| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opabn1stprc | GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| opabn1stprc | ⊢ (∃𝑦𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜑} ∉ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 2805 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 2 | 1 | biantrur 303 | . . . . . . 7 ⊢ (𝜑 ↔ (𝑥 ∈ V ∧ 𝜑)) |
| 3 | 2 | opabbii 4156 | . . . . . 6 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} |
| 4 | 3 | dmeqi 4932 | . . . . 5 ⊢ dom {〈𝑥, 𝑦〉 ∣ 𝜑} = dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} |
| 5 | id 19 | . . . . . . 7 ⊢ (∃𝑦𝜑 → ∃𝑦𝜑) | |
| 6 | 5 | ralrimivw 2606 | . . . . . 6 ⊢ (∃𝑦𝜑 → ∀𝑥 ∈ V ∃𝑦𝜑) |
| 7 | dmopab3 4944 | . . . . . 6 ⊢ (∀𝑥 ∈ V ∃𝑦𝜑 ↔ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} = V) | |
| 8 | 6, 7 | sylib 122 | . . . . 5 ⊢ (∃𝑦𝜑 → dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} = V) |
| 9 | 4, 8 | eqtrid 2276 | . . . 4 ⊢ (∃𝑦𝜑 → dom {〈𝑥, 𝑦〉 ∣ 𝜑} = V) |
| 10 | vprc 4221 | . . . . 5 ⊢ ¬ V ∈ V | |
| 11 | 10 | a1i 9 | . . . 4 ⊢ (∃𝑦𝜑 → ¬ V ∈ V) |
| 12 | 9, 11 | eqneltrd 2327 | . . 3 ⊢ (∃𝑦𝜑 → ¬ dom {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) |
| 13 | dmexg 4996 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V → dom {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) | |
| 14 | 12, 13 | nsyl 633 | . 2 ⊢ (∃𝑦𝜑 → ¬ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) |
| 15 | df-nel 2498 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ∉ V ↔ ¬ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) | |
| 16 | 14, 15 | sylibr 134 | 1 ⊢ (∃𝑦𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜑} ∉ V) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1397 ∃wex 1540 ∈ wcel 2202 ∉ wnel 2497 ∀wral 2510 Vcvv 2802 {copab 4149 dom cdm 4725 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-nel 2498 df-ral 2515 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-cnv 4733 df-dm 4735 df-rn 4736 |
| This theorem is referenced by: griedg0prc 16104 |
| Copyright terms: Public domain | W3C validator |