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 10126 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 8725 | . . 3 ⊢ (𝑁 ≼ ω ↔ (𝑁 ≺ ω ∨ 𝑁 ≈ ω)) | |
2 | isfinite 9340 | . . . . 5 ⊢ (𝑁 ∈ Fin ↔ 𝑁 ≺ ω) | |
3 | axcc4dom.2 | . . . . . . 7 ⊢ (𝑥 = (𝑓‘𝑛) → (𝜑 ↔ 𝜓)) | |
4 | 3 | ac6sfi 8988 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ ∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑) → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) |
5 | 4 | ex 412 | . . . . 5 ⊢ (𝑁 ∈ Fin → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
6 | 2, 5 | sylbir 234 | . . . 4 ⊢ (𝑁 ≺ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
7 | raleq 3333 | . . . . . 6 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑)) | |
8 | feq2 6566 | . . . . . . . 8 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (𝑓:𝑁⟶𝐴 ↔ 𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴)) | |
9 | raleq 3333 | . . . . . . . 8 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∀𝑛 ∈ 𝑁 𝜓 ↔ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)) | |
10 | 8, 9 | anbi12d 630 | . . . . . . 7 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → ((𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓) ↔ (𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓))) |
11 | 10 | exbidv 1925 | . . . . . 6 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓) ↔ ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓))) |
12 | 7, 11 | imbi12d 344 | . . . . 5 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → ((∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) ↔ (∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)))) |
13 | axcc4dom.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
14 | breq1 5073 | . . . . . . 7 ⊢ (𝑁 = if(𝑁 ≈ ω, 𝑁, ω) → (𝑁 ≈ ω ↔ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω)) | |
15 | breq1 5073 | . . . . . . 7 ⊢ (ω = if(𝑁 ≈ ω, 𝑁, ω) → (ω ≈ ω ↔ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω)) | |
16 | omex 9331 | . . . . . . . 8 ⊢ ω ∈ V | |
17 | 16 | enref 8728 | . . . . . . 7 ⊢ ω ≈ ω |
18 | 14, 15, 17 | elimhyp 4521 | . . . . . 6 ⊢ if(𝑁 ≈ ω, 𝑁, ω) ≈ ω |
19 | 13, 18, 3 | axcc4 10126 | . . . . 5 ⊢ (∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:if(𝑁 ≈ ω, 𝑁, ω)⟶𝐴 ∧ ∀𝑛 ∈ if (𝑁 ≈ ω, 𝑁, ω)𝜓)) |
20 | 12, 19 | dedth 4514 | . . . 4 ⊢ (𝑁 ≈ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
21 | 6, 20 | jaoi 853 | . . 3 ⊢ ((𝑁 ≺ ω ∨ 𝑁 ≈ ω) → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
22 | 1, 21 | sylbi 216 | . 2 ⊢ (𝑁 ≼ ω → (∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓))) |
23 | 22 | imp 406 | 1 ⊢ ((𝑁 ≼ ω ∧ ∀𝑛 ∈ 𝑁 ∃𝑥 ∈ 𝐴 𝜑) → ∃𝑓(𝑓:𝑁⟶𝐴 ∧ ∀𝑛 ∈ 𝑁 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 Vcvv 3422 ifcif 4456 class class class wbr 5070 ⟶wf 6414 ‘cfv 6418 ωcom 7687 ≈ cen 8688 ≼ cdom 8689 ≺ csdm 8690 Fincfn 8691 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cc 10122 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 |
This theorem is referenced by: 2ndcctbss 22514 2ndcsep 22518 iscmet3 24362 heiborlem3 35898 |
Copyright terms: Public domain | W3C validator |