Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfss3f Structured version   Visualization version   GIF version

Theorem dfss3f 3560
 Description: Equivalence for subclass relation, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 20-Mar-2004.)
Hypotheses
Ref Expression
dfss2f.1 𝑥𝐴
dfss2f.2 𝑥𝐵
Assertion
Ref Expression
dfss3f (𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)

Proof of Theorem dfss3f
StepHypRef Expression
1 dfss2f.1 . . 3 𝑥𝐴
2 dfss2f.2 . . 3 𝑥𝐵
31, 2dfss2f 3559 . 2 (𝐴𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
4 df-ral 2901 . 2 (∀𝑥𝐴 𝑥𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
53, 4bitr4i 266 1 (𝐴𝐵 ↔ ∀𝑥𝐴 𝑥𝐵)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195  ∀wal 1473   ∈ wcel 1977  Ⅎwnfc 2738  ∀wral 2896   ⊆ wss 3540 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-in 3547  df-ss 3554 This theorem is referenced by:  nfss  3561  sigaclcu2  29510  bnj1498  30383  heibor1  32779  ssrabf  38329  ssrab2f  38331  pimconstlt1  39592  pimltpnf  39593  pimiooltgt  39598  pimdecfgtioc  39602  pimincfltioc  39603  pimdecfgtioo  39604  pimincfltioo  39605  sssmf  39625
 Copyright terms: Public domain W3C validator