![]() |
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 9564 | . . . . . . 7 ⊢ Rel ≼* | |
2 | 1 | brrelex2i 5733 | . . . . . 6 ⊢ (𝑋 ≼* 𝑌 → 𝑌 ∈ V) |
3 | 0domg 9103 | . . . . . 6 ⊢ (𝑌 ∈ V → ∅ ≼ 𝑌) | |
4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝑋 ≼* 𝑌 → ∅ ≼ 𝑌) |
5 | breq1 5151 | . . . . 5 ⊢ (𝑋 = ∅ → (𝑋 ≼ 𝑌 ↔ ∅ ≼ 𝑌)) | |
6 | 4, 5 | imbitrrid 245 | . . . 4 ⊢ (𝑋 = ∅ → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
7 | 6 | adantl 481 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 = ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
8 | brwdomn0 9567 | . . . . 5 ⊢ (𝑋 ≠ ∅ → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋)) | |
9 | 8 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋)) |
10 | vex 3477 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
11 | fof 6805 | . . . . . . . . . 10 ⊢ (𝑥:𝑌–onto→𝑋 → 𝑥:𝑌⟶𝑋) | |
12 | dmfex 7901 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥:𝑌⟶𝑋) → 𝑌 ∈ V) | |
13 | 10, 11, 12 | sylancr 586 | . . . . . . . . 9 ⊢ (𝑥:𝑌–onto→𝑋 → 𝑌 ∈ V) |
14 | 13 | adantl 481 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑌 ∈ V) |
15 | simpl 482 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ∈ Fin) | |
16 | simpr 484 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑥:𝑌–onto→𝑋) | |
17 | fodomfi2 10058 | . . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ 𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ≼ 𝑌) | |
18 | 14, 15, 16, 17 | syl3anc 1370 | . . . . . . 7 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌–onto→𝑋) → 𝑋 ≼ 𝑌) |
19 | 18 | ex 412 | . . . . . 6 ⊢ (𝑋 ∈ Fin → (𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
20 | 19 | adantr 480 | . . . . 5 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
21 | 20 | exlimdv 1935 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (∃𝑥 𝑥:𝑌–onto→𝑋 → 𝑋 ≼ 𝑌)) |
22 | 9, 21 | sylbid 239 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
23 | 7, 22 | pm2.61dane 3028 | . 2 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
24 | domwdom 9572 | . 2 ⊢ (𝑋 ≼ 𝑌 → 𝑋 ≼* 𝑌) | |
25 | 23, 24 | impbid1 224 | 1 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 ↔ 𝑋 ≼ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∃wex 1780 ∈ wcel 2105 ≠ wne 2939 Vcvv 3473 ∅c0 4322 class class class wbr 5148 ⟶wf 6539 –onto→wfo 6541 ≼ cdom 8940 Fincfn 8942 ≼* cwdom 9562 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7728 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 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-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7859 df-1st 7978 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-1o 8469 df-er 8706 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-wdom 9563 df-card 9937 df-acn 9940 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |