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

Theorem ssoprab2b 7488
Description: Equivalence of ordered pair abstraction subclass and implication. Compare ssopab2b 5536. Usage of this theorem is discouraged because it depends on ax-13 2406. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 11-Dec-2016.) (New usage is discouraged.)
Assertion
Ref Expression
ssoprab2b ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} ↔ ∀𝑥𝑦𝑧(𝜑𝜓))

Proof of Theorem ssoprab2b
StepHypRef Expression
1 nfoprab1 7480 . . . 4 𝑥{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
2 nfoprab1 7480 . . . 4 𝑥{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
31, 2nfss 3931 . . 3 𝑥{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
4 nfoprab2 7481 . . . . 5 𝑦{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
5 nfoprab2 7481 . . . . 5 𝑦{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
64, 5nfss 3931 . . . 4 𝑦{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
7 nfoprab3 7482 . . . . . 6 𝑧{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
8 nfoprab3 7482 . . . . . 6 𝑧{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
97, 8nfss 3931 . . . . 5 𝑧{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
10 ssel 3932 . . . . . 6 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} → (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}))
11 oprabid 7451 . . . . . 6 (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜑)
12 oprabid 7451 . . . . . 6 (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} ↔ 𝜓)
1310, 11, 123imtr3g 298 . . . . 5 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} → (𝜑𝜓))
149, 13alrimi 2252 . . . 4 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} → ∀𝑧(𝜑𝜓))
156, 14alrimi 2252 . . 3 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} → ∀𝑦𝑧(𝜑𝜓))
163, 15alrimi 2252 . 2 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} → ∀𝑥𝑦𝑧(𝜑𝜓))
17 ssoprab2 7487 . 2 (∀𝑥𝑦𝑧(𝜑𝜓) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓})
1816, 17impbii 212 1 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} ↔ ∀𝑥𝑦𝑧(𝜑𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wal 1568  wcel 2146  wss 3906  cop 4597  {coprab 7420
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406  ax-ext 2737  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-oprab 7423
This theorem is used by:  eqoprab2b  7490
  Copyright terms: Public domain W3C validator