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

Theorem ssopab2b 5455
Description: Equivalence of ordered pair abstraction subclass and implication. Usage of this theorem is discouraged because it depends on ax-13 2372. Use the weaker ssopab2bw 5453 when possible. (Contributed by NM, 27-Dec-1996.) (Proof shortened by Mario Carneiro, 18-Nov-2016.) (New usage is discouraged.)
Assertion
Ref Expression
ssopab2b ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ ∀𝑥𝑦(𝜑𝜓))

Proof of Theorem ssopab2b
StepHypRef Expression
1 nfopab1 5140 . . . 4 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
2 nfopab1 5140 . . . 4 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜓}
31, 2nfss 3909 . . 3 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓}
4 nfopab2 5141 . . . . 5 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
5 nfopab2 5141 . . . . 5 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜓}
64, 5nfss 3909 . . . 4 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓}
7 ssel 3910 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓}))
8 opabid 5432 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
9 opabid 5432 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜓)
107, 8, 93imtr3g 294 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → (𝜑𝜓))
116, 10alrimi 2209 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → ∀𝑦(𝜑𝜓))
123, 11alrimi 2209 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → ∀𝑥𝑦(𝜑𝜓))
13 ssopab2 5452 . 2 (∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓})
1412, 13impbii 208 1 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ ∀𝑥𝑦(𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wal 1537  wcel 2108  wss 3883  cop 4564  {copab 5132
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-13 2372  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-opab 5133
This theorem is referenced by:  eqopab2b  5458
  Copyright terms: Public domain W3C validator