| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prid1 | GIF version | ||
| Description: An unordered pair contains its first member. Part of Theorem 7.6 of [Quine] p. 49. (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| prid1.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| prid1 | ⊢ 𝐴 ∈ {𝐴, 𝐵} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prid1.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | prid1g 3815 | . 2 ⊢ (𝐴 ∈ V → 𝐴 ∈ {𝐴, 𝐵}) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 𝐴 ∈ {𝐴, 𝐵} |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∈ wcel 2209 Vcvv 2821 {cpr 3710 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-sn 3715 df-pr 3716 |
| This theorem is used by: prid2 3818 prnz 3836 preqr1 3893 preq12b 3895 prel12 3896 opi1 4374 opeluu 4598 onsucelsucexmidlem1 4677 regexmidlem1 4682 reg2exmidlema 4683 opthreg 4705 ordtri2or2exmid 4720 ontri2orexmidim 4721 dmrnssfld 5047 funopg 5414 acexmidlemb 6080 0lt2o 6718 2dom 7097 unfiexmid 7229 djuss 7416 exmidomni 7488 pr2cv1 7547 exmidonfinlem 7551 exmidaclem 7570 reelprrecn 8320 pnfxr 8384 sup3exmid 9295 fun2dmnop0 11324 fnpr2ob 13720 ppiublem2 16292 lgsdir2lem3 16354 upgrex 16549 upgr1een 16570 eulerpathprum 16926 bdop 17106 2o01f 17229 iswomni0 17308 |
| Copyright terms: Public domain | W3C validator |