Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > aomclem7 | Structured version Visualization version GIF version |
Description: Lemma for dfac11 39669. (𝑅1‘𝐴) is well-orderable. (Contributed by Stefan O'Rear, 20-Jan-2015.) |
Ref | Expression |
---|---|
aomclem6.b | ⊢ 𝐵 = {〈𝑎, 𝑏〉 ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))} |
aomclem6.c | ⊢ 𝐶 = (𝑎 ∈ V ↦ sup((𝑦‘𝑎), (𝑅1‘dom 𝑧), 𝐵)) |
aomclem6.d | ⊢ 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) |
aomclem6.e | ⊢ 𝐸 = {〈𝑎, 𝑏〉 ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})} |
aomclem6.f | ⊢ 𝐹 = {〈𝑎, 𝑏〉 ∣ ((rank‘𝑎) E (rank‘𝑏) ∨ ((rank‘𝑎) = (rank‘𝑏) ∧ 𝑎(𝑧‘suc (rank‘𝑎))𝑏))} |
aomclem6.g | ⊢ 𝐺 = (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) |
aomclem6.h | ⊢ 𝐻 = recs((𝑧 ∈ V ↦ 𝐺)) |
aomclem6.a | ⊢ (𝜑 → 𝐴 ∈ On) |
aomclem6.y | ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅}))) |
Ref | Expression |
---|---|
aomclem7 | ⊢ (𝜑 → ∃𝑏 𝑏 We (𝑅1‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | aomclem6.b | . . 3 ⊢ 𝐵 = {〈𝑎, 𝑏〉 ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))} | |
2 | aomclem6.c | . . 3 ⊢ 𝐶 = (𝑎 ∈ V ↦ sup((𝑦‘𝑎), (𝑅1‘dom 𝑧), 𝐵)) | |
3 | aomclem6.d | . . 3 ⊢ 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) | |
4 | aomclem6.e | . . 3 ⊢ 𝐸 = {〈𝑎, 𝑏〉 ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})} | |
5 | aomclem6.f | . . 3 ⊢ 𝐹 = {〈𝑎, 𝑏〉 ∣ ((rank‘𝑎) E (rank‘𝑏) ∨ ((rank‘𝑎) = (rank‘𝑏) ∧ 𝑎(𝑧‘suc (rank‘𝑎))𝑏))} | |
6 | aomclem6.g | . . 3 ⊢ 𝐺 = (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) | |
7 | aomclem6.h | . . 3 ⊢ 𝐻 = recs((𝑧 ∈ V ↦ 𝐺)) | |
8 | aomclem6.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ On) | |
9 | aomclem6.y | . . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅}))) | |
10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | aomclem6 39666 | . 2 ⊢ (𝜑 → (𝐻‘𝐴) We (𝑅1‘𝐴)) |
11 | fvex 6685 | . . 3 ⊢ (𝐻‘𝐴) ∈ V | |
12 | weeq1 5545 | . . 3 ⊢ (𝑏 = (𝐻‘𝐴) → (𝑏 We (𝑅1‘𝐴) ↔ (𝐻‘𝐴) We (𝑅1‘𝐴))) | |
13 | 11, 12 | spcev 3609 | . 2 ⊢ ((𝐻‘𝐴) We (𝑅1‘𝐴) → ∃𝑏 𝑏 We (𝑅1‘𝐴)) |
14 | 10, 13 | syl 17 | 1 ⊢ (𝜑 → ∃𝑏 𝑏 We (𝑅1‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 = wceq 1537 ∃wex 1780 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 ∃wrex 3141 Vcvv 3496 ∖ cdif 3935 ∩ cin 3937 ∅c0 4293 ifcif 4469 𝒫 cpw 4541 {csn 4569 ∪ cuni 4840 ∩ cint 4878 class class class wbr 5068 {copab 5130 ↦ cmpt 5148 E cep 5466 We wwe 5515 × cxp 5555 ◡ccnv 5556 dom cdm 5557 ran crn 5558 “ cima 5560 Oncon0 6193 suc csuc 6195 ‘cfv 6357 recscrecs 8009 Fincfn 8511 supcsup 8906 𝑅1cr1 9193 rankcrnk 9194 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-2o 8105 df-er 8291 df-map 8410 df-en 8512 df-fin 8515 df-sup 8908 df-r1 9195 df-rank 9196 |
This theorem is referenced by: aomclem8 39668 |
Copyright terms: Public domain | W3C validator |