| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opabn1stprc | Structured version Visualization version 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 3434 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 2 | 1 | biantrur 530 | . . . . . . 7 ⊢ (𝜑 ↔ (𝑥 ∈ V ∧ 𝜑)) |
| 3 | 2 | opabbii 5153 | . . . . . 6 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} |
| 4 | 3 | dmeqi 5855 | . . . . 5 ⊢ dom {〈𝑥, 𝑦〉 ∣ 𝜑} = dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} |
| 5 | id 22 | . . . . . . 7 ⊢ (∃𝑦𝜑 → ∃𝑦𝜑) | |
| 6 | 5 | ralrimivw 3134 | . . . . . 6 ⊢ (∃𝑦𝜑 → ∀𝑥 ∈ V ∃𝑦𝜑) |
| 7 | dmopab3 5870 | . . . . . 6 ⊢ (∀𝑥 ∈ V ∃𝑦𝜑 ↔ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} = V) | |
| 8 | 6, 7 | sylib 218 | . . . . 5 ⊢ (∃𝑦𝜑 → dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ V ∧ 𝜑)} = V) |
| 9 | 4, 8 | eqtrid 2784 | . . . 4 ⊢ (∃𝑦𝜑 → dom {〈𝑥, 𝑦〉 ∣ 𝜑} = V) |
| 10 | vprc 5253 | . . . . 5 ⊢ ¬ V ∈ V | |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (∃𝑦𝜑 → ¬ V ∈ V) |
| 12 | 9, 11 | eqneltrd 2857 | . . 3 ⊢ (∃𝑦𝜑 → ¬ dom {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) |
| 13 | dmexg 7847 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V → dom {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) | |
| 14 | 12, 13 | nsyl 140 | . 2 ⊢ (∃𝑦𝜑 → ¬ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) |
| 15 | df-nel 3038 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ∉ V ↔ ¬ {〈𝑥, 𝑦〉 ∣ 𝜑} ∈ V) | |
| 16 | 14, 15 | sylibr 234 | 1 ⊢ (∃𝑦𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜑} ∉ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∉ wnel 3037 ∀wral 3052 Vcvv 3430 {copab 5148 dom cdm 5626 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-pr 5372 ax-un 7684 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-nel 3038 df-ral 3053 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-cnv 5634 df-dm 5636 df-rn 5637 |
| This theorem is referenced by: griedg0prc 29351 |
| Copyright terms: Public domain | W3C validator |