| 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 1210 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐴 ∈ Fin) | |
| 2 | simpr 489 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ 𝐴 ⊆ 𝐵) | |
| 3 | simpl3 1212 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) | |
| 4 | orel1 901 | . . . . . . . 8 ⊢ (¬ 𝐴 ⊆ 𝐵 → ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) → 𝐵 ⊆ 𝐴)) | |
| 5 | 2, 3, 4 | sylc 66 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊆ 𝐴) |
| 6 | dfpss3 4043 | . . . . . . 7 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐴 ⊆ 𝐵)) | |
| 7 | 5, 2, 6 | sylanbrc 594 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊊ 𝐴) |
| 8 | php3 9189 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
| 9 | 1, 7, 8 | syl2anc 595 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ≺ 𝐴) |
| 10 | 9 | ex 417 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → 𝐵 ≺ 𝐴)) |
| 11 | domnsym 9087 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴) | |
| 12 | 11 | con2i 140 | . . . 4 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐴 ≼ 𝐵) |
| 13 | 10, 12 | syl6 36 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → ¬ 𝐴 ≼ 𝐵)) |
| 14 | 13 | con4d 116 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
| 15 | ssdomg 8993 | . . 3 ⊢ (𝐵 ∈ Fin → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) | |
| 16 | 15 | 3ad2ant2 1152 | . 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 1103 ∈ wcel 2143 ⊆ wss 3905 ⊊ wpss 3906 class class class wbr 5109 ≼ cdom 8937 ≺ csdm 8938 Fincfn 8939 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-om 7859 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 |
| This theorem is referenced by: fin1a2lem11 10389 |
| Copyright terms: Public domain | W3C validator |