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

Theorem 0neqopab 6123
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 4395 . . 3 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3 nfopab1 4195 . . . . . 6 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
43nfel2 2405 . . . . 5 𝑥∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
54nfn 1710 . . . 4 𝑥 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
6 nfopab2 4196 . . . . . . 7 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
76nfel2 2405 . . . . . 6 𝑦∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
87nfn 1710 . . . . 5 𝑦 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
9 vex 2824 . . . . . . . 8 𝑥 ∈ V
10 vex 2824 . . . . . . . 8 𝑦 ∈ V
119, 10opnzi 4370 . . . . . . 7 𝑥, 𝑦⟩ ≠ ∅
12 nesym 2465 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ≠ ∅ ↔ ¬ ∅ = ⟨𝑥, 𝑦⟩)
13 pm2.21 626 . . . . . . . 8 (¬ ∅ = ⟨𝑥, 𝑦⟩ → (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
1412, 13sylbi 121 . . . . . . 7 (⟨𝑥, 𝑦⟩ ≠ ∅ → (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
1511, 14ax-mp 5 . . . . . 6 (∅ = ⟨𝑥, 𝑦⟩ → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
1615adantr 276 . . . . 5 ((∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
178, 16exlimi 1647 . . . 4 (∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
185, 17exlimi 1647 . . 3 (∃𝑥𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
192, 18sylbi 121 . 2 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
201, 19pm2.65i 648 1 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1402  wex 1545  wcel 2209  wne 2420  c0 3520  cop 3708  {copab 4186
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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator