Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ttukeylem4 | Structured version Visualization version GIF version |
Description: Lemma for ttukey 9340. (Contributed by Mario Carneiro, 15-May-2015.) |
Ref | Expression |
---|---|
ttukeylem.1 | ⊢ (𝜑 → 𝐹:(card‘(∪ 𝐴 ∖ 𝐵))–1-1-onto→(∪ 𝐴 ∖ 𝐵)) |
ttukeylem.2 | ⊢ (𝜑 → 𝐵 ∈ 𝐴) |
ttukeylem.3 | ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) |
ttukeylem.4 | ⊢ 𝐺 = recs((𝑧 ∈ V ↦ if(dom 𝑧 = ∪ dom 𝑧, if(dom 𝑧 = ∅, 𝐵, ∪ ran 𝑧), ((𝑧‘∪ dom 𝑧) ∪ if(((𝑧‘∪ dom 𝑧) ∪ {(𝐹‘∪ dom 𝑧)}) ∈ 𝐴, {(𝐹‘∪ dom 𝑧)}, ∅))))) |
Ref | Expression |
---|---|
ttukeylem4 | ⊢ (𝜑 → (𝐺‘∅) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elon 5778 | . . 3 ⊢ ∅ ∈ On | |
2 | ttukeylem.1 | . . . 4 ⊢ (𝜑 → 𝐹:(card‘(∪ 𝐴 ∖ 𝐵))–1-1-onto→(∪ 𝐴 ∖ 𝐵)) | |
3 | ttukeylem.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐴) | |
4 | ttukeylem.3 | . . . 4 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) | |
5 | ttukeylem.4 | . . . 4 ⊢ 𝐺 = recs((𝑧 ∈ V ↦ if(dom 𝑧 = ∪ dom 𝑧, if(dom 𝑧 = ∅, 𝐵, ∪ ran 𝑧), ((𝑧‘∪ dom 𝑧) ∪ if(((𝑧‘∪ dom 𝑧) ∪ {(𝐹‘∪ dom 𝑧)}) ∈ 𝐴, {(𝐹‘∪ dom 𝑧)}, ∅))))) | |
6 | 2, 3, 4, 5 | ttukeylem3 9333 | . . 3 ⊢ ((𝜑 ∧ ∅ ∈ On) → (𝐺‘∅) = if(∅ = ∪ ∅, if(∅ = ∅, 𝐵, ∪ (𝐺 “ ∅)), ((𝐺‘∪ ∅) ∪ if(((𝐺‘∪ ∅) ∪ {(𝐹‘∪ ∅)}) ∈ 𝐴, {(𝐹‘∪ ∅)}, ∅)))) |
7 | 1, 6 | mpan2 707 | . 2 ⊢ (𝜑 → (𝐺‘∅) = if(∅ = ∪ ∅, if(∅ = ∅, 𝐵, ∪ (𝐺 “ ∅)), ((𝐺‘∪ ∅) ∪ if(((𝐺‘∪ ∅) ∪ {(𝐹‘∪ ∅)}) ∈ 𝐴, {(𝐹‘∪ ∅)}, ∅)))) |
8 | uni0 4465 | . . . . 5 ⊢ ∪ ∅ = ∅ | |
9 | 8 | eqcomi 2631 | . . . 4 ⊢ ∅ = ∪ ∅ |
10 | 9 | iftruei 4093 | . . 3 ⊢ if(∅ = ∪ ∅, if(∅ = ∅, 𝐵, ∪ (𝐺 “ ∅)), ((𝐺‘∪ ∅) ∪ if(((𝐺‘∪ ∅) ∪ {(𝐹‘∪ ∅)}) ∈ 𝐴, {(𝐹‘∪ ∅)}, ∅))) = if(∅ = ∅, 𝐵, ∪ (𝐺 “ ∅)) |
11 | eqid 2622 | . . . 4 ⊢ ∅ = ∅ | |
12 | 11 | iftruei 4093 | . . 3 ⊢ if(∅ = ∅, 𝐵, ∪ (𝐺 “ ∅)) = 𝐵 |
13 | 10, 12 | eqtri 2644 | . 2 ⊢ if(∅ = ∪ ∅, if(∅ = ∅, 𝐵, ∪ (𝐺 “ ∅)), ((𝐺‘∪ ∅) ∪ if(((𝐺‘∪ ∅) ∪ {(𝐹‘∪ ∅)}) ∈ 𝐴, {(𝐹‘∪ ∅)}, ∅))) = 𝐵 |
14 | 7, 13 | syl6eq 2672 | 1 ⊢ (𝜑 → (𝐺‘∅) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∀wal 1481 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ∖ cdif 3571 ∪ cun 3572 ∩ cin 3573 ⊆ wss 3574 ∅c0 3915 ifcif 4086 𝒫 cpw 4158 {csn 4177 ∪ cuni 4436 ↦ cmpt 4729 dom cdm 5114 ran crn 5115 “ cima 5117 Oncon0 5723 –1-1-onto→wf1o 5887 ‘cfv 5888 recscrecs 7467 Fincfn 7955 cardccrd 8761 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-wrecs 7407 df-recs 7468 |
This theorem is referenced by: ttukeylem7 9337 |
Copyright terms: Public domain | W3C validator |