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

Theorem 0neqopab 5570
Description: The empty set is never an element in an ordered-pair class abstraction. (Contributed by Alexander van der Vekens, 5-Nov-2017.)
Assertion
Ref Expression
0neqopab ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem 0neqopab
StepHypRef Expression
1 id 19 . 2 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
2 elopab 4013 . . 3 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3 nfopab1 3847 . . . . . 6 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
43nfel2 2231 . . . . 5 𝑥∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
54nfn 1588 . . . 4 𝑥 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
6 nfopab2 3848 . . . . . . 7 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
76nfel2 2231 . . . . . 6 𝑦∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
87nfn 1588 . . . . 5 𝑦 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
9 vex 2604 . . . . . . . 8 𝑥 ∈ V
10 vex 2604 . . . . . . . 8 𝑦 ∈ V
119, 10opnzi 3990 . . . . . . 7 𝑥, 𝑦⟩ ≠ ∅
12 nesym 2290 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ≠ ∅ ↔ ¬ ∅ = ⟨𝑥, 𝑦⟩)
13 pm2.21 579 . . . . . . . 8 (¬ ∅ = ⟨𝑥, 𝑦⟩ → (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
1412, 13sylbi 119 . . . . . . 7 (⟨𝑥, 𝑦⟩ ≠ ∅ → (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
1511, 14ax-mp 7 . . . . . 6 (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
1615adantr 270 . . . . 5 ((∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
178, 16exlimi 1525 . . . 4 (∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
185, 17exlimi 1525 . . 3 (∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
192, 18sylbi 119 . 2 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
201, 19pm2.65i 600 1 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102   = wceq 1284  wex 1421  wcel 1433  wne 2245  c0 3251  cop 3401  {copab 3838
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-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-opab 3840
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator