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

Theorem opabn1stprc 6423
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 2824 . . . . . . . 8 𝑥 ∈ V
21biantrur 303 . . . . . . 7 (𝜑 ↔ (𝑥 ∈ V ∧ 𝜑))
32opabbii 4196 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)}
43dmeqi 4980 . . . . 5 dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} = dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)}
5 id 19 . . . . . . 7 (∃𝑦𝜑 → ∃𝑦𝜑)
65ralrimivw 2624 . . . . . 6 (∃𝑦𝜑 → ∀𝑥 ∈ V ∃𝑦𝜑)
7 dmopab3 4992 . . . . . 6 (∀𝑥 ∈ V ∃𝑦𝜑 ↔ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)} = V)
86, 7sylib 122 . . . . 5 (∃𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝜑)} = V)
94, 8eqtrid 2283 . . . 4 (∃𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} = V)
10 vprc 4263 . . . . 5 ¬ V ∈ V
1110a1i 9 . . . 4 (∃𝑦𝜑 → ¬ V ∈ V)
129, 11eqneltrd 2334 . . 3 (∃𝑦𝜑 → ¬ dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
13 dmexg 5044 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V → dom {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
1412, 13nsyl 637 . 2 (∃𝑦𝜑 → ¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
15 df-nel 2516 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∉ V ↔ ¬ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∈ V)
1614, 15sylibr 134 1 (∃𝑦𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∉ V)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1402  wex 1545  wcel 2209  wnel 2515  wral 2528  Vcvv 2821  {copab 4189  dom cdm 4772
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-13 2211  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-nel 2516  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-cnv 4780  df-dm 4782  df-rn 4783
This theorem is referenced by:  griedg0prc  16474
  Copyright terms: Public domain W3C validator