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 9033 | . . . . . . 7 ⊢ Rel ≼* | |
2 | 1 | brrelex2i 5612 | . . . . . 6 ⊢ (𝑋 ≼* 𝑌 → 𝑌 ∈ V) |
3 | 0domg 8647 | . . . . . 6 ⊢ (𝑌 ∈ V → ∅ ≼ 𝑌) | |
4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝑋 ≼* 𝑌 → ∅ ≼ 𝑌) |
5 | breq1 5072 | . . . . 5 ⊢ (𝑋 = ∅ → (𝑋 ≼ 𝑌 ↔ ∅ ≼ 𝑌)) | |
6 | 4, 5 | syl5ibr 248 | . . . 4 ⊢ (𝑋 = ∅ → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
7 | 6 | adantl 484 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 = ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
8 | brwdomn0 9036 | . . . . 5 ⊢ (𝑋 ≠ ∅ → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋)) | |
9 | 8 | adantl 484 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋)) |
10 | vex 3500 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
11 | fof 6593 | . . . . . . . . . 10 ⊢ (𝑥:𝑌–onto→𝑋 → 𝑥:𝑌⟶𝑋) | |
12 | dmfex 7644 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥:𝑌⟶𝑋) → 𝑌 ∈ V) | |
13 | 10, 11, 12 | sylancr 589 | . . . . . . . . 9 ⊢ (𝑥:𝑌–onto→𝑋 → 𝑌 ∈ V) |
14 | 13 | adantl 484 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑌 ∈ V) |
15 | simpl 485 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ∈ Fin) | |
16 | simpr 487 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑥:𝑌–onto→𝑋) | |
17 | fodomfi2 9489 | . . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ 𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ≼ 𝑌) | |
18 | 14, 15, 16, 17 | syl3anc 1367 | . . . . . . 7 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ≼ 𝑌) |
19 | 18 | ex 415 | . . . . . 6 ⊢ (𝑋 ∈ Fin → (𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
20 | 19 | adantr 483 | . . . . 5 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
21 | 20 | exlimdv 1933 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (∃𝑥 𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
22 | 9, 21 | sylbid 242 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
23 | 7, 22 | pm2.61dane 3107 | . 2 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
24 | domwdom 9041 | . 2 ⊢ (𝑋 ≼ 𝑌 → 𝑋 ≼* 𝑌) | |
25 | 23, 24 | impbid1 227 | 1 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 ↔ 𝑋 ≼ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∃wex 1779 ∈ wcel 2113 ≠ wne 3019 Vcvv 3497 ∅c0 4294 class class class wbr 5069 ⟶wf 6354 –onto→wfo 6356 ≼ cdom 8510 Fincfn 8512 ≼* cwdom 9024 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-isom 6367 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-1o 8105 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-wdom 9026 df-card 9371 df-acn 9374 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |