| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > aomclem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for dfac11 44330. This is the beginning of the proof that
multiple
choice is equivalent to choice. Our goal is to construct, by
transfinite recursion, a well-ordering of (𝑅1‘𝐴). In what
follows, 𝐴 is the index of the rank we wish to
well-order, 𝑧 is
the collection of well-orderings constructed so far, dom 𝑧 is
the
set of ordinal indices of constructed ranks i.e. the next rank to
construct, and 𝑦 is a postulated multiple-choice
function.
Successor case 1, define a simple ordering from the well-ordered predecessor. (Contributed by Stefan O'Rear, 18-Jan-2015.) |
| Ref | Expression |
|---|---|
| aomclem1.b | ⊢ 𝐵 = {〈𝑎, 𝑏〉 ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))} |
| aomclem1.on | ⊢ (𝜑 → dom 𝑧 ∈ On) |
| aomclem1.su | ⊢ (𝜑 → dom 𝑧 = suc ∪ dom 𝑧) |
| aomclem1.we | ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎)) |
| Ref | Expression |
|---|---|
| aomclem1 | ⊢ (𝜑 → 𝐵 Or (𝑅1‘dom 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6929 | . . 3 ⊢ (𝑅1‘∪ dom 𝑧) ∈ V | |
| 2 | vex 3458 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 3 | 2 | dmex 7955 | . . . . . . 7 ⊢ dom 𝑧 ∈ V |
| 4 | 3 | uniex 7790 | . . . . . 6 ⊢ ∪ dom 𝑧 ∈ V |
| 5 | 4 | sucid 6473 | . . . . 5 ⊢ ∪ dom 𝑧 ∈ suc ∪ dom 𝑧 |
| 6 | aomclem1.su | . . . . 5 ⊢ (𝜑 → dom 𝑧 = suc ∪ dom 𝑧) | |
| 7 | 5, 6 | eleqtrrid 2871 | . . . 4 ⊢ (𝜑 → ∪ dom 𝑧 ∈ dom 𝑧) |
| 8 | aomclem1.we | . . . 4 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎)) | |
| 9 | fveq2 6916 | . . . . . 6 ⊢ (𝑎 = ∪ dom 𝑧 → (𝑧‘𝑎) = (𝑧‘∪ dom 𝑧)) | |
| 10 | fveq2 6916 | . . . . . 6 ⊢ (𝑎 = ∪ dom 𝑧 → (𝑅1‘𝑎) = (𝑅1‘∪ dom 𝑧)) | |
| 11 | 9, 10 | weeq12d 5647 | . . . . 5 ⊢ (𝑎 = ∪ dom 𝑧 → ((𝑧‘𝑎) We (𝑅1‘𝑎) ↔ (𝑧‘∪ dom 𝑧) We (𝑅1‘∪ dom 𝑧))) |
| 12 | 11 | rspcva 3578 | . . . 4 ⊢ ((∪ dom 𝑧 ∈ dom 𝑧 ∧ ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎)) → (𝑧‘∪ dom 𝑧) We (𝑅1‘∪ dom 𝑧)) |
| 13 | 7, 8, 12 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑧‘∪ dom 𝑧) We (𝑅1‘∪ dom 𝑧)) |
| 14 | aomclem1.b | . . . 4 ⊢ 𝐵 = {〈𝑎, 𝑏〉 ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))} | |
| 15 | 14 | wepwso 44316 | . . 3 ⊢ (((𝑅1‘∪ dom 𝑧) ∈ V ∧ (𝑧‘∪ dom 𝑧) We (𝑅1‘∪ dom 𝑧)) → 𝐵 Or 𝒫 (𝑅1‘∪ dom 𝑧)) |
| 16 | 1, 13, 15 | sylancr 599 | . 2 ⊢ (𝜑 → 𝐵 Or 𝒫 (𝑅1‘∪ dom 𝑧)) |
| 17 | 6 | fveq2d 6920 | . . . 4 ⊢ (𝜑 → (𝑅1‘dom 𝑧) = (𝑅1‘suc ∪ dom 𝑧)) |
| 18 | aomclem1.on | . . . . 5 ⊢ (𝜑 → dom 𝑧 ∈ On) | |
| 19 | onuni 7836 | . . . . 5 ⊢ (dom 𝑧 ∈ On → ∪ dom 𝑧 ∈ On) | |
| 20 | r1suc 9814 | . . . . 5 ⊢ (∪ dom 𝑧 ∈ On → (𝑅1‘suc ∪ dom 𝑧) = 𝒫 (𝑅1‘∪ dom 𝑧)) | |
| 21 | 18, 19, 20 | 3syl 19 | . . . 4 ⊢ (𝜑 → (𝑅1‘suc ∪ dom 𝑧) = 𝒫 (𝑅1‘∪ dom 𝑧)) |
| 22 | 17, 21 | eqtrd 2798 | . . 3 ⊢ (𝜑 → (𝑅1‘dom 𝑧) = 𝒫 (𝑅1‘∪ dom 𝑧)) |
| 23 | soeq2 5588 | . . 3 ⊢ ((𝑅1‘dom 𝑧) = 𝒫 (𝑅1‘∪ dom 𝑧) → (𝐵 Or (𝑅1‘dom 𝑧) ↔ 𝐵 Or 𝒫 (𝑅1‘∪ dom 𝑧))) | |
| 24 | 22, 23 | syl 18 | . 2 ⊢ (𝜑 → (𝐵 Or (𝑅1‘dom 𝑧) ↔ 𝐵 Or 𝒫 (𝑅1‘∪ dom 𝑧))) |
| 25 | 16, 24 | mpbird 260 | 1 ⊢ (𝜑 → 𝐵 Or (𝑅1‘dom 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 Vcvv 3454 𝒫 cpw 4560 ∪ cuni 4872 class class class wbr 5108 {copab 5173 Or wor 5565 We wwe 5610 dom cdm 5658 Oncon0 6388 suc csuc 6390 ‘cfv 6566 𝑅1cr1 9803 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-map 8887 df-r1 9805 |
| This theorem is used by: aomclem2 44323 |
| Copyright terms: Public domain | W3C validator |