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

Theorem ssopab2b 5436
Description: Equivalence of ordered pair abstraction subclass and implication. Usage of this theorem is discouraged because it depends on ax-13 2390. Use the weaker ssopab2bw 5434 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 5135 . . . 4 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
2 nfopab1 5135 . . . 4 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜓}
31, 2nfss 3960 . . 3 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓}
4 nfopab2 5136 . . . . 5 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
5 nfopab2 5136 . . . . 5 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜓}
64, 5nfss 3960 . . . 4 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓}
7 ssel 3961 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓}))
8 opabid 5413 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
9 opabid 5413 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜓)
107, 8, 93imtr3g 297 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → (𝜑𝜓))
116, 10alrimi 2213 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → ∀𝑦(𝜑𝜓))
123, 11alrimi 2213 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} → ∀𝑥𝑦(𝜑𝜓))
13 ssopab2 5433 . 2 (∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓})
1412, 13impbii 211 1 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ ∀𝑥𝑦(𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1535  wcel 2114  wss 3936  cop 4573  {copab 5128
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-13 2390  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-opab 5129
This theorem is referenced by:  eqopab2b  5439
  Copyright terms: Public domain W3C validator