| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axcc4dom | Structured version Visualization version GIF version | ||
| Description: Relax the constraint on axcc4 10321 to dominance instead of equinumerosity. (Contributed by Mario Carneiro, 18-Jan-2014.) |
| Ref | Expression |
|---|---|
| axcc4dom.1 | ⊢ 𝐴 ∈ V |
| axcc4dom.2 | ⊢ (𝑥 = (𝑓‘𝑛) → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| axcc4dom | ⊢ ((𝑁 ≼ ω ∧ ∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑) → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdom2 8898 | . . 3 ⊢ (𝑁 ≼ ω ↔ (𝑁 ≺ ω ∨ 𝑁 ≈ ω)) | |
| 2 | isfinite 9536 | . . . . 5 ⊢ (𝑁 ∈ Fin ↔ 𝑁 ≺ ω) | |
| 3 | axcc4dom.2 | . . . . . . 7 ⊢ (𝑥 = (𝑓‘𝑛) → (𝜑 ↔ 𝜓)) | |
| 4 | 3 | ac6sfi 9162 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ ∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑) → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) |
| 5 | 4 | ex 412 | . . . . 5 ⊢ (𝑁 ∈ Fin → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 6 | 2, 5 | sylbir 235 | . . . 4 ⊢ (𝑁 ≺ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 7 | raleq 3286 | . . . . . 6 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑)) | |
| 8 | feq2 6625 | . . . . . . . 8 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (𝑓:𝑁⟶𝐴 ↔ 𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴)) | |
| 9 | raleq 3286 | . . . . . . . 8 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∀𝑛 ∈ 𝑁 𝜓 ↔ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)) | |
| 10 | 8, 9 | anbi12d 632 | . . . . . . 7 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → ((𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓) ↔ (𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓))) |
| 11 | 10 | exbidv 1921 | . . . . . 6 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓) ↔ ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓))) |
| 12 | 7, 11 | imbi12d 344 | . . . . 5 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → ((∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) ↔ (∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)))) |
| 13 | axcc4dom.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 14 | breq1 5091 | . . . . . . 7 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (𝑁 ≈ ω ↔ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω)) | |
| 15 | breq1 5091 | . . . . . . 7 ⊢ (ω = if(𝑁 ≈ ω, 𝑁, ω) → (ω ≈ ω ↔ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω)) | |
| 16 | omex 9527 | . . . . . . . 8 ⊢ ω ∈ V | |
| 17 | 16 | enref 8901 | . . . . . . 7 ⊢ ω ≈ ω |
| 18 | 14, 15, 17 | elimhyp 4538 | . . . . . 6 ⊢ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω |
| 19 | 13, 18, 3 | axcc4 10321 | . . . . 5 ⊢ (∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)) |
| 20 | 12, 19 | dedth 4531 | . . . 4 ⊢ (𝑁 ≈ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 21 | 6, 20 | jaoi 857 | . . 3 ⊢ ((𝑁 ≺ ω ∨ 𝑁 ≈ ω) → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 22 | 1, 21 | sylbi 217 | . 2 ⊢ (𝑁 ≼ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 23 | 22 | imp 406 | 1 ⊢ ((𝑁 ≼ ω ∧ ∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑) → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 Vcvv 3433 ifcif 4472 class class class wbr 5088 ⟶wf 6472 ‘cfv 6476 ωcom 7790 ≈ cen 8860 ≼ cdom 8861 ≺ csdm 8862 Fincfn 8863 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5214 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5367 ax-un 7662 ax-inf2 9525 ax-cc 10317 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3393 df-v 3435 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4895 df-iun 4940 df-br 5089 df-opab 5151 df-mpt 5170 df-tr 5196 df-id 5508 df-eprel 5513 df-po 5521 df-so 5522 df-fr 5566 df-we 5568 df-xp 5619 df-rel 5620 df-cnv 5621 df-co 5622 df-dm 5623 df-rn 5624 df-res 5625 df-ima 5626 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-ov 7343 df-om 7791 df-2nd 7916 df-frecs 8205 df-wrecs 8236 df-recs 8285 df-rdg 8323 df-1o 8379 df-er 8616 df-en 8864 df-dom 8865 df-sdom 8866 df-fin 8867 |
| This theorem is referenced by: 2ndcctbss 23324 2ndcsep 23328 iscmet3 25174 heiborlem3 37810 |
| Copyright terms: Public domain | W3C validator |