| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prdom2 | Structured version Visualization version GIF version | ||
| Description: An unordered pair has at most two elements. (Contributed by FL, 22-Feb-2011.) |
| Ref | Expression |
|---|---|
| prdom2 | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsn2 4597 | . . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | ensn1g 9031 | . . . . . . 7 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≈ 1o) | |
| 3 | endom 8988 | . . . . . . . 8 ⊢ ({𝐴} ≈ 1o → {𝐴} ≼ 1o) | |
| 4 | 1sdom2 9221 | . . . . . . . 8 ⊢ 1o ≺ 2o | |
| 5 | domsdomtr 9113 | . . . . . . . . 9 ⊢ (({𝐴} ≼ 1o ∧ 1o ≺ 2o) → {𝐴} ≺ 2o) | |
| 6 | sdomdom 8989 | . . . . . . . . 9 ⊢ ({𝐴} ≺ 2o → {𝐴} ≼ 2o) | |
| 7 | 5, 6 | syl 18 | . . . . . . . 8 ⊢ (({𝐴} ≼ 1o ∧ 1o ≺ 2o) → {𝐴} ≼ 2o) |
| 8 | 3, 4, 7 | sylancl 598 | . . . . . . 7 ⊢ ({𝐴} ≈ 1o → {𝐴} ≼ 2o) |
| 9 | 2, 8 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≼ 2o) |
| 10 | 1, 9 | eqbrtrrid 5141 | . . . . 5 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐴} ≼ 2o) |
| 11 | preq2 4695 | . . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴}) | |
| 12 | 11 | breq1d 5113 | . . . . 5 ⊢ (𝐵 = 𝐴 → ({𝐴, 𝐵} ≼ 2o ↔ {𝐴, 𝐴} ≼ 2o)) |
| 13 | 10, 12 | imbitrrid 249 | . . . 4 ⊢ (𝐵 = 𝐴 → (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≼ 2o)) |
| 14 | 13 | eqcoms 2768 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≼ 2o)) |
| 15 | 14 | adantrd 497 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o)) |
| 16 | pr2ne 10011 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵)) | |
| 17 | 16 | biimprd 251 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ≠ 𝐵 → {𝐴, 𝐵} ≈ 2o)) |
| 18 | endom 8988 | . . 3 ⊢ ({𝐴, 𝐵} ≈ 2o → {𝐴, 𝐵} ≼ 2o) | |
| 19 | 17, 18 | syl6com 38 | . 2 ⊢ (𝐴 ≠ 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o)) |
| 20 | 15, 19 | pm2.61ine 3038 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 {csn 4584 {cpr 4586 class class class wbr 5103 1oc1o 8451 2oc2o 8452 ≈ cen 8952 ≼ cdom 8953 ≺ csdm 8954 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-1o 8458 df-2o 8459 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |