![]() |
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 1191 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐴 ∈ Fin) | |
2 | simpr 485 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ 𝐴 ⊆ 𝐵) | |
3 | simpl3 1193 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) | |
4 | orel1 887 | . . . . . . . 8 ⊢ (¬ 𝐴 ⊆ 𝐵 → ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) → 𝐵 ⊆ 𝐴)) | |
5 | 2, 3, 4 | sylc 65 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊆ 𝐴) |
6 | dfpss3 4082 | . . . . . . 7 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐴 ⊆ 𝐵)) | |
7 | 5, 2, 6 | sylanbrc 583 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊊ 𝐴) |
8 | php3 9195 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
9 | 1, 7, 8 | syl2anc 584 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ≺ 𝐴) |
10 | 9 | ex 413 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → 𝐵 ≺ 𝐴)) |
11 | domnsym 9082 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴) | |
12 | 11 | con2i 139 | . . . 4 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐴 ≼ 𝐵) |
13 | 10, 12 | syl6 35 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → ¬ 𝐴 ≼ 𝐵)) |
14 | 13 | con4d 115 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
15 | ssdomg 8979 | . . 3 ⊢ (𝐵 ∈ Fin → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) | |
16 | 15 | 3ad2ant2 1134 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
17 | 14, 16 | impbid 211 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 ∧ w3a 1087 ∈ wcel 2106 ⊆ wss 3944 ⊊ wpss 3945 class class class wbr 5141 ≼ cdom 8920 ≺ csdm 8921 Fincfn 8922 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-om 7839 df-1o 8448 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 |
This theorem is referenced by: fin1a2lem11 10387 |
Copyright terms: Public domain | W3C validator |