Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > opprc | GIF version |
Description: Expansion of an ordered pair when either member is a proper class. (Contributed by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
opprc | ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-op 3598 | . 2 ⊢ 〈𝐴, 𝐵〉 = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} | |
2 | 3simpa 994 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
3 | 2 | con3i 632 | . . . 4 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) |
4 | 3 | alrimiv 1872 | . . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ∀𝑥 ¬ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) |
5 | abeq0 3451 | . . 3 ⊢ ({𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ∅ ↔ ∀𝑥 ¬ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) | |
6 | 4, 5 | sylibr 134 | . 2 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ∅) |
7 | 1, 6 | eqtrid 2220 | 1 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = ∅) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∧ w3a 978 ∀wal 1351 = wceq 1353 ∈ wcel 2146 {cab 2161 Vcvv 2735 ∅c0 3420 {csn 3589 {cpr 3590 〈cop 3592 |
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 614 ax-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-v 2737 df-dif 3129 df-nul 3421 df-op 3598 |
This theorem is referenced by: opprc1 3796 opprc2 3797 ovprc 5900 |
Copyright terms: Public domain | W3C validator |