| 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 4591 | . . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | ensn1g 8957 | . . . . . . 7 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≈ 1o) | |
| 3 | endom 8914 | . . . . . . . 8 ⊢ ({𝐴} ≈ 1o → {𝐴} ≼ 1o) | |
| 4 | 1sdom2 9146 | . . . . . . . 8 ⊢ 1o ≺ 2o | |
| 5 | domsdomtr 9038 | . . . . . . . . 9 ⊢ (({𝐴} ≼ 1o ∧ 1o ≺ 2o) → {𝐴} ≺ 2o) | |
| 6 | sdomdom 8915 | . . . . . . . . 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 5132 | . . . . 5 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐴} ≼ 2o) |
| 11 | preq2 4689 | . . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴}) | |
| 12 | 11 | breq1d 5106 | . . . . 5 ⊢ (𝐵 = 𝐴 → ({𝐴, 𝐵} ≼ 2o ↔ {𝐴, 𝐴} ≼ 2o)) |
| 13 | 10, 12 | imbitrrid 246 | . . . 4 ⊢ (𝐵 = 𝐴 → (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≼ 2o)) |
| 14 | 13 | eqcoms 2742 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≼ 2o)) |
| 15 | 14 | adantrd 491 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o)) |
| 16 | pr2ne 9913 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵)) | |
| 17 | 16 | biimprd 248 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ≠ 𝐵 → {𝐴, 𝐵} ≈ 2o)) |
| 18 | endom 8914 | . . 3 ⊢ ({𝐴, 𝐵} ≈ 2o → {𝐴, 𝐵} ≼ 2o) | |
| 19 | 17, 18 | syl6com 37 | . 2 ⊢ (𝐴 ≠ 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o)) |
| 20 | 15, 19 | pm2.61ine 3013 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝐴, 𝐵} ≼ 2o) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 {csn 4578 {cpr 4580 class class class wbr 5096 1oc1o 8388 2oc2o 8389 ≈ cen 8878 ≼ cdom 8879 ≺ csdm 8880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-1o 8395 df-2o 8396 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |