![]() |
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 1190 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐴 ∈ Fin) | |
2 | simpr 484 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ 𝐴 ⊆ 𝐵) | |
3 | simpl3 1192 | . . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) | |
4 | orel1 888 | . . . . . . . 8 ⊢ (¬ 𝐴 ⊆ 𝐵 → ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) → 𝐵 ⊆ 𝐴)) | |
5 | 2, 3, 4 | sylc 65 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊆ 𝐴) |
6 | dfpss3 4099 | . . . . . . 7 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐴 ⊆ 𝐵)) | |
7 | 5, 2, 6 | sylanbrc 583 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊊ 𝐴) |
8 | php3 9247 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
9 | 1, 7, 8 | syl2anc 584 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ≺ 𝐴) |
10 | 9 | ex 412 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → 𝐵 ≺ 𝐴)) |
11 | domnsym 9138 | . . . . 5 ⊢ (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴) | |
12 | 11 | con2i 139 | . . . 4 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐴 ≼ 𝐵) |
13 | 10, 12 | syl6 35 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (¬ 𝐴 ⊆ 𝐵 → ¬ 𝐴 ≼ 𝐵)) |
14 | 13 | con4d 115 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
15 | ssdomg 9039 | . . 3 ⊢ (𝐵 ∈ Fin → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) | |
16 | 15 | 3ad2ant2 1133 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
17 | 14, 16 | impbid 212 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴)) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 ∈ wcel 2106 ⊆ wss 3963 ⊊ wpss 3964 class class class wbr 5148 ≼ cdom 8982 ≺ csdm 8983 Fincfn 8984 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-om 7888 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 |
This theorem is referenced by: fin1a2lem11 10448 |
Copyright terms: Public domain | W3C validator |