| 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 10352 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 8922 | . . 3 ⊢ (𝑁 ≼ ω ↔ (𝑁 ≺ ω ∨ 𝑁 ≈ ω)) | |
| 2 | isfinite 9564 | . . . . 5 ⊢ (𝑁 ∈ Fin ↔ 𝑁 ≺ ω) | |
| 3 | axcc4dom.2 | . . . . . . 7 ⊢ (𝑥 = (𝑓‘𝑛) → (𝜑 ↔ 𝜓)) | |
| 4 | 3 | ac6sfi 9187 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ ∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑) → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) |
| 5 | 4 | ex 412 | . . . . 5 ⊢ (𝑁 ∈ Fin → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 6 | 2, 5 | sylbir 235 | . . . 4 ⊢ (𝑁 ≺ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 7 | raleq 3293 | . . . . . 6 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑)) | |
| 8 | feq2 6641 | . . . . . . . 8 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (𝑓:𝑁⟶𝐴 ↔ 𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴)) | |
| 9 | raleq 3293 | . . . . . . . 8 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∀𝑛 ∈ 𝑁 𝜓 ↔ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)) | |
| 10 | 8, 9 | anbi12d 633 | . . . . . . 7 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → ((𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓) ↔ (𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓))) |
| 11 | 10 | exbidv 1923 | . . . . . 6 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓) ↔ ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓))) |
| 12 | 7, 11 | imbi12d 344 | . . . . 5 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → ((∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) ↔ (∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)))) |
| 13 | axcc4dom.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 14 | breq1 5089 | . . . . . . 7 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (𝑁 ≈ ω ↔ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω)) | |
| 15 | breq1 5089 | . . . . . . 7 ⊢ (ω = if(𝑁 ≈ ω, 𝑁, ω) → (ω ≈ ω ↔ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω)) | |
| 16 | omex 9555 | . . . . . . . 8 ⊢ ω ∈ V | |
| 17 | 16 | enref 8925 | . . . . . . 7 ⊢ ω ≈ ω |
| 18 | 14, 15, 17 | elimhyp 4533 | . . . . . 6 ⊢ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω |
| 19 | 13, 18, 3 | axcc4 10352 | . . . . 5 ⊢ (∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)) |
| 20 | 12, 19 | dedth 4526 | . . . 4 ⊢ (𝑁 ≈ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
| 21 | 6, 20 | jaoi 858 | . . 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 848 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 Vcvv 3430 ifcif 4467 class class class wbr 5086 ⟶wf 6488 ‘cfv 6492 ωcom 7810 ≈ cen 8883 ≼ cdom 8884 ≺ csdm 8885 Fincfn 8886 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-inf2 9553 ax-cc 10348 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7363 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 |
| This theorem is referenced by: 2ndcctbss 23430 2ndcsep 23434 iscmet3 25270 heiborlem3 38148 |
| Copyright terms: Public domain | W3C validator |