Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wdomfil | Structured version Visualization version GIF version |
Description: Weak dominance agrees with normal for finite left sets. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by Mario Carneiro, 5-May-2015.) |
Ref | Expression |
---|---|
wdomfil | ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 ↔ 𝑋 ≼ 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relwdom 9303 | . . . . . . 7 ⊢ Rel ≼* | |
2 | 1 | brrelex2i 5645 | . . . . . 6 ⊢ (𝑋 ≼* 𝑌 → 𝑌 ∈ V) |
3 | 0domg 8869 | . . . . . 6 ⊢ (𝑌 ∈ V → ∅ ≼ 𝑌) | |
4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝑋 ≼* 𝑌 → ∅ ≼ 𝑌) |
5 | breq1 5082 | . . . . 5 ⊢ (𝑋 = ∅ → (𝑋 ≼ 𝑌 ↔ ∅ ≼ 𝑌)) | |
6 | 4, 5 | syl5ibr 245 | . . . 4 ⊢ (𝑋 = ∅ → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
7 | 6 | adantl 482 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 = ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
8 | brwdomn0 9306 | . . . . 5 ⊢ (𝑋 ≠ ∅ → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋)) | |
9 | 8 | adantl 482 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋)) |
10 | vex 3435 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
11 | fof 6686 | . . . . . . . . . 10 ⊢ (𝑥:𝑌–onto→𝑋 → 𝑥:𝑌⟶𝑋) | |
12 | dmfex 7748 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥:𝑌⟶𝑋) → 𝑌 ∈ V) | |
13 | 10, 11, 12 | sylancr 587 | . . . . . . . . 9 ⊢ (𝑥:𝑌–onto→𝑋 → 𝑌 ∈ V) |
14 | 13 | adantl 482 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑌 ∈ V) |
15 | simpl 483 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ∈ Fin) | |
16 | simpr 485 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑥:𝑌–onto→𝑋) | |
17 | fodomfi2 9817 | . . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ 𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ≼ 𝑌) | |
18 | 14, 15, 16, 17 | syl3anc 1370 | . . . . . . 7 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ≼ 𝑌) |
19 | 18 | ex 413 | . . . . . 6 ⊢ (𝑋 ∈ Fin → (𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
20 | 19 | adantr 481 | . . . . 5 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
21 | 20 | exlimdv 1940 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (∃𝑥 𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
22 | 9, 21 | sylbid 239 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
23 | 7, 22 | pm2.61dane 3034 | . 2 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
24 | domwdom 9311 | . 2 ⊢ (𝑋 ≼ 𝑌 → 𝑋 ≼* 𝑌) | |
25 | 23, 24 | impbid1 224 | 1 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 ↔ 𝑋 ≼ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1542 ∃wex 1786 ∈ wcel 2110 ≠ wne 2945 Vcvv 3431 ∅c0 4262 class class class wbr 5079 ⟶wf 6428 –onto→wfo 6430 ≼ cdom 8714 Fincfn 8716 ≼* cwdom 9301 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-ral 3071 df-rex 3072 df-reu 3073 df-rmo 3074 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-int 4886 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-se 5546 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-isom 6441 df-riota 7228 df-ov 7274 df-oprab 7275 df-mpo 7276 df-om 7707 df-1st 7824 df-2nd 7825 df-frecs 8088 df-wrecs 8119 df-recs 8193 df-1o 8288 df-er 8481 df-map 8600 df-en 8717 df-dom 8718 df-sdom 8719 df-fin 8720 df-wdom 9302 df-card 9698 df-acn 9701 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |