| 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 4602 | . . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | ensn1g 8993 | . . . . . . 7 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≈ 1o) | |
| 3 | endom 8950 | . . . . . . . 8 ⊢ ({𝐴} ≈ 1o → {𝐴} ≼ 1o) | |
| 4 | 1sdom2 9187 | . . . . . . . 8 ⊢ 1o ≺ 2o | |
| 5 | domsdomtr 9076 | . . . . . . . . 9 ⊢ (({𝐴} ≼ 1o ∧ 1o ≺ 2o) → {𝐴} ≺ 2o) | |
| 6 | sdomdom 8951 | . . . . . . . . 9 ⊢ ({𝐴} ≺ 2o → {𝐴} ≼ 2o) | |
| 7 | 5, 6 | syl 17 | . . . . . . . 8 ⊢ (({𝐴} ≼ 1o ∧ 1o ≺ 2o) → {𝐴} ≼ 2o) |
| 8 | 3, 4, 7 | sylancl 586 | . . . . . . 7 ⊢ ({𝐴} ≈ 1o → {𝐴} ≼ 2o) |
| 9 | 2, 8 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≼ 2o) |
| 10 | 1, 9 | eqbrtrrid 5143 | . . . . 5 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐴} ≼ 2o) |
| 11 | preq2 4698 | . . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴}) | |
| 12 | 11 | breq1d 5117 | . . . . 5 ⊢ (𝐵 = 𝐴 → ({𝐴, 𝐵} ≼ 2o ↔ {𝐴, 𝐴} ≼ 2o)) |
| 13 | 10, 12 | imbitrrid 246 | . . . 4 ⊢ (𝐵 = 𝐴 → (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≼ 2o)) |
| 14 | 13 | eqcoms 2737 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≼ 2o)) |
| 15 | 14 | adantrd 491 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o)) |
| 16 | pr2ne 9957 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵)) | |
| 17 | 16 | biimprd 248 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ≠ 𝐵 → {𝐴, 𝐵} ≈ 2o)) |
| 18 | endom 8950 | . . 3 ⊢ ({𝐴, 𝐵} ≈ 2o → {𝐴, 𝐵} ≼ 2o) | |
| 19 | 17, 18 | syl6com 37 | . 2 ⊢ (𝐴 ≠ 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o)) |
| 20 | 15, 19 | pm2.61ine 3008 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 {csn 4589 {cpr 4591 class class class wbr 5107 1oc1o 8427 2oc2o 8428 ≈ cen 8915 ≼ cdom 8916 ≺ csdm 8917 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-1o 8434 df-2o 8435 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |