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

Theorem ssopab2 4093
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 1479 . . . 4 𝑥𝑥𝑦(𝜑𝜓)
2 nfa1 1479 . . . . . 6 𝑦𝑦(𝜑𝜓)
3 sp 1446 . . . . . . 7 (∀𝑦(𝜑𝜓) → (𝜑𝜓))
43anim2d 330 . . . . . 6 (∀𝑦(𝜑𝜓) → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
52, 4eximd 1548 . . . . 5 (∀𝑦(𝜑𝜓) → (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
65sps 1475 . . . 4 (∀𝑥𝑦(𝜑𝜓) → (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
71, 6eximd 1548 . . 3 (∀𝑥𝑦(𝜑𝜓) → (∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
87ss2abdv 3092 . 2 (∀𝑥𝑦(𝜑𝜓) → {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ⊆ {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)})
9 df-opab 3892 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
10 df-opab 3892 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
118, 9, 103sstr4g 3065 1 (∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜓})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wal 1287   = wceq 1289  wex 1426  {cab 2074  wss 2997  cop 3444  {copab 3890
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-in 3003  df-ss 3010  df-opab 3892
This theorem is referenced by:  ssopab2b  4094  ssopab2i  4095  ssopab2dv  4096
  Copyright terms: Public domain W3C validator