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

Theorem opabn1stprc 6363
Description: An ordered-pair class abstraction which does not depend on the first abstraction variable is a proper class. There must be, however, at least one set which satisfies the restricting wff. (Contributed by AV, 27-Dec-2020.)
Assertion
Ref Expression
opabn1stprc (∃𝑦𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∉ V)
Distinct variable groups:   𝑥,𝑦   𝜑,𝑥
Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem opabn1stprc
StepHypRef Expression
1 vex 2804 . . . . . . . 8 𝑥 ∈ V
21biantrur 303 . . . . . . 7 (𝜑 ↔ (𝑥 ∈ V ∧ 𝜑))
32opabbii 4157 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)}
43dmeqi 4934 . . . . 5 dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} = dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)}
5 id 19 . . . . . . 7 (∃𝑦𝜑 → ∃𝑦𝜑)
65ralrimivw 2605 . . . . . 6 (∃𝑦𝜑 → ∀𝑥 ∈ V ∃𝑦𝜑)
7 dmopab3 4946 . . . . . 6 (∀𝑥 ∈ V ∃𝑦𝜑 ↔ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)} = V)
86, 7sylib 122 . . . . 5 (∃𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)} = V)
94, 8eqtrid 2275 . . . 4 (∃𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} = V)
10 vprc 4222 . . . . 5 ¬ V ∈ V
1110a1i 9 . . . 4 (∃𝑦𝜑 → ¬ V ∈ V)
129, 11eqneltrd 2326 . . 3 (∃𝑦𝜑 → ¬ dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
13 dmexg 4998 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V → dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
1412, 13nsyl 633 . 2 (∃𝑦𝜑 → ¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
15 df-nel 2497 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∉ V ↔ ¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
1614, 15sylibr 134 1 (∃𝑦𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∉ V)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1397  wex 1540  wcel 2201  wnel 2496  wral 2509  Vcvv 2801  {copab 4150  dom cdm 4727
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-nel 2497  df-ral 2514  df-rex 2515  df-v 2803  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-br 4090  df-opab 4152  df-cnv 4735  df-dm 4737  df-rn 4738
This theorem is referenced by:  griedg0prc  16130
  Copyright terms: Public domain W3C validator