Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > aomclem3 | Structured version Visualization version GIF version |
Description: Lemma for dfac11 40887. Successor case 3, our required well-ordering. (Contributed by Stefan O'Rear, 19-Jan-2015.) |
Ref | Expression |
---|---|
aomclem3.b | ⊢ 𝐵 = {〈𝑎, 𝑏〉 ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))} |
aomclem3.c | ⊢ 𝐶 = (𝑎 ∈ V ↦ sup((𝑦‘𝑎), (𝑅1‘dom 𝑧), 𝐵)) |
aomclem3.d | ⊢ 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) |
aomclem3.e | ⊢ 𝐸 = {〈𝑎, 𝑏〉 ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})} |
aomclem3.on | ⊢ (𝜑 → dom 𝑧 ∈ On) |
aomclem3.su | ⊢ (𝜑 → dom 𝑧 = suc ∪ dom 𝑧) |
aomclem3.we | ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎)) |
aomclem3.a | ⊢ (𝜑 → 𝐴 ∈ On) |
aomclem3.za | ⊢ (𝜑 → dom 𝑧 ⊆ 𝐴) |
aomclem3.y | ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅}))) |
Ref | Expression |
---|---|
aomclem3 | ⊢ (𝜑 → 𝐸 We (𝑅1‘dom 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | aomclem3.d | . . 3 ⊢ 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) | |
2 | rneq 5845 | . . . . . . 7 ⊢ (𝑎 = 𝑐 → ran 𝑎 = ran 𝑐) | |
3 | 2 | difeq2d 4057 | . . . . . 6 ⊢ (𝑎 = 𝑐 → ((𝑅1‘dom 𝑧) ∖ ran 𝑎) = ((𝑅1‘dom 𝑧) ∖ ran 𝑐)) |
4 | 3 | fveq2d 6778 | . . . . 5 ⊢ (𝑎 = 𝑐 → (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)) = (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))) |
5 | 4 | cbvmptv 5187 | . . . 4 ⊢ (𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))) = (𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))) |
6 | recseq 8205 | . . . 4 ⊢ ((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))) = (𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))) → recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) = recs((𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))))) | |
7 | 5, 6 | ax-mp 5 | . . 3 ⊢ recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) = recs((𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐)))) |
8 | 1, 7 | eqtri 2766 | . 2 ⊢ 𝐷 = recs((𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐)))) |
9 | fvexd 6789 | . 2 ⊢ (𝜑 → (𝑅1‘dom 𝑧) ∈ V) | |
10 | aomclem3.b | . . . 4 ⊢ 𝐵 = {〈𝑎, 𝑏〉 ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))} | |
11 | aomclem3.c | . . . 4 ⊢ 𝐶 = (𝑎 ∈ V ↦ sup((𝑦‘𝑎), (𝑅1‘dom 𝑧), 𝐵)) | |
12 | aomclem3.on | . . . 4 ⊢ (𝜑 → dom 𝑧 ∈ On) | |
13 | aomclem3.su | . . . 4 ⊢ (𝜑 → dom 𝑧 = suc ∪ dom 𝑧) | |
14 | aomclem3.we | . . . 4 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎)) | |
15 | aomclem3.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ On) | |
16 | aomclem3.za | . . . 4 ⊢ (𝜑 → dom 𝑧 ⊆ 𝐴) | |
17 | aomclem3.y | . . . 4 ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅}))) | |
18 | 10, 11, 12, 13, 14, 15, 16, 17 | aomclem2 40880 | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑎 ≠ ∅ → (𝐶‘𝑎) ∈ 𝑎)) |
19 | neeq1 3006 | . . . . 5 ⊢ (𝑎 = 𝑑 → (𝑎 ≠ ∅ ↔ 𝑑 ≠ ∅)) | |
20 | fveq2 6774 | . . . . . 6 ⊢ (𝑎 = 𝑑 → (𝐶‘𝑎) = (𝐶‘𝑑)) | |
21 | id 22 | . . . . . 6 ⊢ (𝑎 = 𝑑 → 𝑎 = 𝑑) | |
22 | 20, 21 | eleq12d 2833 | . . . . 5 ⊢ (𝑎 = 𝑑 → ((𝐶‘𝑎) ∈ 𝑎 ↔ (𝐶‘𝑑) ∈ 𝑑)) |
23 | 19, 22 | imbi12d 345 | . . . 4 ⊢ (𝑎 = 𝑑 → ((𝑎 ≠ ∅ → (𝐶‘𝑎) ∈ 𝑎) ↔ (𝑑 ≠ ∅ → (𝐶‘𝑑) ∈ 𝑑))) |
24 | 23 | cbvralvw 3383 | . . 3 ⊢ (∀𝑎 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑎 ≠ ∅ → (𝐶‘𝑎) ∈ 𝑎) ↔ ∀𝑑 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑑 ≠ ∅ → (𝐶‘𝑑) ∈ 𝑑)) |
25 | 18, 24 | sylib 217 | . 2 ⊢ (𝜑 → ∀𝑑 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑑 ≠ ∅ → (𝐶‘𝑑) ∈ 𝑑)) |
26 | aomclem3.e | . 2 ⊢ 𝐸 = {〈𝑎, 𝑏〉 ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})} | |
27 | 8, 9, 25, 26 | dnwech 40873 | 1 ⊢ (𝜑 → 𝐸 We (𝑅1‘dom 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 Vcvv 3432 ∖ cdif 3884 ∩ cin 3886 ⊆ wss 3887 ∅c0 4256 𝒫 cpw 4533 {csn 4561 ∪ cuni 4839 ∩ cint 4879 class class class wbr 5074 {copab 5136 ↦ cmpt 5157 We wwe 5543 ◡ccnv 5588 dom cdm 5589 ran crn 5590 “ cima 5592 Oncon0 6266 suc csuc 6268 ‘cfv 6433 recscrecs 8201 Fincfn 8733 supcsup 9199 𝑅1cr1 9520 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-2o 8298 df-map 8617 df-en 8734 df-fin 8737 df-sup 9201 df-r1 9522 |
This theorem is referenced by: aomclem5 40883 |
Copyright terms: Public domain | W3C validator |