ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ssopab2 GIF version

Theorem ssopab2 4293
Description: Equivalence of ordered pair abstraction subclass and implication. (Contributed by NM, 27-Dec-1996.) (Revised by Mario Carneiro, 19-May-2013.)
Assertion
Ref Expression
ssopab2 (∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓})

Proof of Theorem ssopab2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfa1 1552 . . . 4 𝑥𝑥𝑦(𝜑𝜓)
2 nfa1 1552 . . . . . 6 𝑦𝑦(𝜑𝜓)
3 sp 1522 . . . . . . 7 (∀𝑦(𝜑𝜓) → (𝜑𝜓))
43anim2d 337 . . . . . 6 (∀𝑦(𝜑𝜓) → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
52, 4eximd 1623 . . . . 5 (∀𝑦(𝜑𝜓) → (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
65sps 1548 . . . 4 (∀𝑥𝑦(𝜑𝜓) → (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
71, 6eximd 1623 . . 3 (∀𝑥𝑦(𝜑𝜓) → (∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
87ss2abdv 3243 . 2 (∀𝑥𝑦(𝜑𝜓) → {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ⊆ {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)})
9 df-opab 4080 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
10 df-opab 4080 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
118, 9, 103sstr4g 3213 1 (∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1362   = wceq 1364  wex 1503  {cab 2175  wss 3144  cop 3610  {copab 4078
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-in 3150  df-ss 3157  df-opab 4080
This theorem is referenced by:  ssopab2b  4294  ssopab2i  4295  ssopab2dv  4296
  Copyright terms: Public domain W3C validator