| 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 9597 | . . . . . . 7 ⊢ Rel ≼* | |
| 2 | 1 | brrelex2i 5715 | . . . . . 6 ⊢ (𝑋 ≼* 𝑌 → 𝑌 ∈ V) |
| 3 | 0domg 9161 | . . . . . 6 ⊢ (𝑌 ∈ V → ∅ ≼ 𝑌) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ (𝑋 ≼* 𝑌 → ∅ ≼ 𝑌) |
| 5 | breq1 5111 | . . . . 5 ⊢ (𝑋 = ∅ → (𝑋 ≼ 𝑌 ↔ ∅ ≼ 𝑌)) | |
| 6 | 4, 5 | imbitrrid 249 | . . . 4 ⊢ (𝑋 = ∅ → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
| 7 | 6 | adantl 487 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 = ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
| 8 | brwdomn0 9600 | . . . . 5 ⊢ (𝑋 ≠ ∅ → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌⟶onto𝑋)) | |
| 9 | 8 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌⟶onto𝑋)) |
| 10 | vex 3458 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
| 11 | fof 6826 | . . . . . . . . . 10 ⊢ (𝑥:𝑌⟶onto𝑋 → 𝑥:𝑌⟶𝑋) | |
| 12 | dmfex 7951 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥:𝑌⟶𝑋) → 𝑌 ∈ V) | |
| 13 | 10, 11, 12 | sylancr 599 | . . . . . . . . 9 ⊢ (𝑥:𝑌⟶onto𝑋 → 𝑌 ∈ V) |
| 14 | 13 | adantl 487 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌⟶onto𝑋) → 𝑌 ∈ V) |
| 15 | simpl 488 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌⟶onto𝑋) → 𝑋 ∈ Fin) | |
| 16 | simpr 490 | . . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌⟶onto𝑋) → 𝑥:𝑌⟶onto𝑋) | |
| 17 | fodomfi2 10178 | . . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ 𝑋 ∈ Fin ∧ 𝑥:𝑌⟶onto𝑋) → 𝑋 ≼ 𝑌) | |
| 18 | 14, 15, 16, 17 | syl3anc 1399 | . . . . . . 7 ⊢ ((𝑋 ∈ Fin ∧ 𝑥:𝑌⟶onto𝑋) → 𝑋 ≼ 𝑌) |
| 19 | 18 | ex 418 | . . . . . 6 ⊢ (𝑋 ∈ Fin → (𝑥:𝑌⟶onto𝑋 → 𝑋 ≼ 𝑌)) |
| 20 | 19 | adantr 486 | . . . . 5 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑥:𝑌⟶onto𝑋 → 𝑋 ≼ 𝑌)) |
| 21 | 20 | exlimdv 1968 | . . . 4 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (∃𝑥 𝑥:𝑌⟶onto𝑋 → 𝑋 ≼ 𝑌)) |
| 22 | 9, 21 | sylbid 243 | . . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
| 23 | 7, 22 | pm2.61dane 3046 | . 2 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 → 𝑋 ≼ 𝑌)) |
| 24 | domwdom 9605 | . 2 ⊢ (𝑋 ≼ 𝑌 → 𝑋 ≼* 𝑌) | |
| 25 | 23, 24 | impbid1 228 | 1 ⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 ↔ 𝑋 ≼ 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ∅c0 4281 class class class wbr 5108 ⟶wf 6562 ⟶ontowfo 6564 ≼ cdom 9009 Fincfn 9011 ≼* cwdom 9595 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-1o 8514 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-wdom 9596 df-card 10057 df-acn 10060 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |