Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > prnzg | GIF version |
Description: A pair containing a set is not empty. (Contributed by FL, 19-Sep-2011.) |
Ref | Expression |
---|---|
prnzg | ⊢ (𝐴 ∈ 𝑉 → {𝐴, 𝐵} ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preq1 3653 | . . 3 ⊢ (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵}) | |
2 | 1 | neeq1d 2354 | . 2 ⊢ (𝑥 = 𝐴 → ({𝑥, 𝐵} ≠ ∅ ↔ {𝐴, 𝐵} ≠ ∅)) |
3 | vex 2729 | . . 3 ⊢ 𝑥 ∈ V | |
4 | 3 | prnz 3698 | . 2 ⊢ {𝑥, 𝐵} ≠ ∅ |
5 | 2, 4 | vtoclg 2786 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝐴, 𝐵} ≠ ∅) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1343 ∈ wcel 2136 ≠ wne 2336 ∅c0 3409 {cpr 3577 |
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-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-v 2728 df-dif 3118 df-un 3120 df-nul 3410 df-sn 3582 df-pr 3583 |
This theorem is referenced by: 0nelop 4226 |
Copyright terms: Public domain | W3C validator |