| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fincssdom | Structured version Visualization version GIF version | ||
| Description: In a chain of finite sets, dominance and subset coincide. (Contributed by Stefan O'Rear, 8-Nov-2014.) |
| Ref | Expression |
|---|---|
| fincssdom | ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1208 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐴 ∈ Fin) | |
| 2 | simpr 489 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ 𝐴 ⊆ 𝐵) | |
| 3 | simpl3 1210 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) | |
| 4 | orel1 901 | . . . . . . . 8 ⊢ (¬ 𝐴 ⊆ 𝐵 → ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) → 𝐵 ⊆ 𝐴)) | |
| 5 | 2, 3, 4 | sylc 66 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊆ 𝐴) |
| 6 | dfpss3 4051 | . . . . . . 7 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐴 ⊆ 𝐵)) | |
| 7 | 5, 2, 6 | sylanbrc 594 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊊ 𝐴) |
| 8 | php3 9193 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
| 9 | 1, 7, 8 | syl2anc 595 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ≺ 𝐴) |
| 10 | 9 | ex 417 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → 𝐵 ≺ 𝐴)) |
| 11 | domnsym 9091 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴) | |
| 12 | 11 | con2i 140 | . . . 4 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐴 ≼ 𝐵) |
| 13 | 10, 12 | syl6 36 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → ¬ 𝐴 ≼ 𝐵)) |
| 14 | 13 | con4d 116 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
| 15 | ssdomg 8997 | . . 3 ⊢ (𝐵 ∈ Fin → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) | |
| 16 | 15 | 3ad2ant2 1150 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
| 17 | 14, 16 | impbid 215 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 ∈ wcel 2149 ⊆ wss 3913 ⊊ wpss 3914 class class class wbr 5113 ≼ cdom 8941 ≺ csdm 8942 Fincfn 8943 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-om 7863 df-1o 8453 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 |
| This theorem is referenced by: fin1a2lem11 10394 |
| Copyright terms: Public domain | W3C validator |