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 3585 | . 2 ⊢ 〈𝐴, 𝐵〉 = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} | |
2 | 3simpa 984 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
3 | 2 | con3i 622 | . . . 4 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) |
4 | 3 | alrimiv 1862 | . . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ∀𝑥 ¬ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) |
5 | abeq0 3439 | . . 3 ⊢ ({𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ∅ ↔ ∀𝑥 ¬ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) | |
6 | 4, 5 | sylibr 133 | . 2 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ∅) |
7 | 1, 6 | syl5eq 2211 | 1 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = ∅) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∧ w3a 968 ∀wal 1341 = wceq 1343 ∈ wcel 2136 {cab 2151 Vcvv 2726 ∅c0 3409 {csn 3576 {cpr 3577 〈cop 3579 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-v 2728 df-dif 3118 df-nul 3410 df-op 3585 |
This theorem is referenced by: opprc1 3780 opprc2 3781 ovprc 5877 |
Copyright terms: Public domain | W3C validator |