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

Theorem ssopab2b 5534
Description: Equivalence of ordered pair abstraction subclass and implication. Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker ssopab2bw 5532 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 5181 . . . 4 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
2 nfopab1 5181 . . . 4 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜓}
31, 2nfss 3930 . . 3 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓}
4 nfopab2 5182 . . . . 5 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
5 nfopab2 5182 . . . . 5 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜓}
64, 5nfss 3930 . . . 4 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓}
7 ssel 3931 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓}))
8 opabid 5509 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
9 opabid 5509 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜓)
107, 8, 93imtr3g 298 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → (𝜑𝜓))
116, 10alrimi 2249 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → ∀𝑦(𝜑𝜓))
123, 11alrimi 2249 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → ∀𝑥𝑦(𝜑𝜓))
13 ssopab2 5531 . 2 (∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓})
1412, 13impbii 212 1 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ ∀𝑥𝑦(𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wal 1568  wcel 2143  wss 3905  cop 4595  {copab 5173
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5174
This theorem is referenced by:  eqopab2b  5537
  Copyright terms: Public domain W3C validator