Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  aomclem5 Structured version   Visualization version   GIF version

Theorem aomclem5 43902
Description: Lemma for dfac11 43906. Combine the successor case with the limit case. (Contributed by Stefan O'Rear, 20-Jan-2015.)
Hypotheses
Ref Expression
aomclem5.b 𝐵 = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐 ∈ (𝑅1 dom 𝑧)((𝑐𝑏 ∧ ¬ 𝑐𝑎) ∧ ∀𝑑 ∈ (𝑅1 dom 𝑧)(𝑑(𝑧 dom 𝑧)𝑐 → (𝑑𝑎𝑑𝑏)))}
aomclem5.c 𝐶 = (𝑎 ∈ V ↦ sup((𝑦𝑎), (𝑅1‘dom 𝑧), 𝐵))
aomclem5.d 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))))
aomclem5.e 𝐸 = {⟨𝑎, 𝑏⟩ ∣ (𝐷 “ {𝑎}) ∈ (𝐷 “ {𝑏})}
aomclem5.f 𝐹 = {⟨𝑎, 𝑏⟩ ∣ ((rank‘𝑎) E (rank‘𝑏) ∨ ((rank‘𝑎) = (rank‘𝑏) ∧ 𝑎(𝑧‘suc (rank‘𝑎))𝑏))}
aomclem5.g 𝐺 = (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧)))
aomclem5.on (𝜑 → dom 𝑧 ∈ On)
aomclem5.we (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
aomclem5.a (𝜑𝐴 ∈ On)
aomclem5.za (𝜑 → dom 𝑧𝐴)
aomclem5.y (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1𝐴)(𝑎 ≠ ∅ → (𝑦𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
Assertion
Ref Expression
aomclem5 (𝜑𝐺 We (𝑅1‘dom 𝑧))
Distinct variable groups:   𝑦,𝑧,𝑎,𝑏,𝑐,𝑑   𝜑,𝑎,𝑏   𝐶,𝑎,𝑏,𝑐,𝑑   𝐷,𝑎,𝑏,𝑐,𝑑
Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑐, 𝑑)   𝐴(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝐵(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝐶(𝑦, 𝑧)   𝐷(𝑦, 𝑧)   𝐸(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝐹(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝐺(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)

Proof of Theorem aomclem5
StepHypRef Expression
1 aomclem5.f . . . . . 6 𝐹 = {⟨𝑎, 𝑏⟩ ∣ ((rank‘𝑎) E (rank‘𝑏) ∨ ((rank‘𝑎) = (rank‘𝑏) ∧ 𝑎(𝑧‘suc (rank‘𝑎))𝑏))}
2 aomclem5.on . . . . . . 7 (𝜑 → dom 𝑧 ∈ On)
32adantr 486 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → dom 𝑧 ∈ On)
4 simpr 490 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → dom 𝑧 = dom 𝑧)
5 aomclem5.we . . . . . . 7 (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
65adantr 486 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
71, 3, 4, 6aomclem4 43901 . . . . 5 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → 𝐹 We (𝑅1‘dom 𝑧))
8 iftrue 4488 . . . . . . 7 (dom 𝑧 = dom 𝑧 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐹)
98adantl 487 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐹)
10 eqidd 2761 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
119, 10weeq12d 5644 . . . . 5 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ 𝐹 We (𝑅1‘dom 𝑧)))
127, 11mpbird 260 . . . 4 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
13 aomclem5.b . . . . . 6 𝐵 = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐 ∈ (𝑅1 dom 𝑧)((𝑐𝑏 ∧ ¬ 𝑐𝑎) ∧ ∀𝑑 ∈ (𝑅1 dom 𝑧)(𝑑(𝑧 dom 𝑧)𝑐 → (𝑑𝑎𝑑𝑏)))}
14 aomclem5.c . . . . . 6 𝐶 = (𝑎 ∈ V ↦ sup((𝑦𝑎), (𝑅1‘dom 𝑧), 𝐵))
15 aomclem5.d . . . . . 6 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))))
16 aomclem5.e . . . . . 6 𝐸 = {⟨𝑎, 𝑏⟩ ∣ (𝐷 “ {𝑎}) ∈ (𝐷 “ {𝑏})}
172adantr 486 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → dom 𝑧 ∈ On)
18 eloni 6367 . . . . . . . 8 (dom 𝑧 ∈ On → Ord dom 𝑧)
19 orduniorsuc 7827 . . . . . . . 8 (Ord dom 𝑧 → (dom 𝑧 = dom 𝑧 ∨ dom 𝑧 = suc dom 𝑧))
202, 18, 193syl 19 . . . . . . 7 (𝜑 → (dom 𝑧 = dom 𝑧 ∨ dom 𝑧 = suc dom 𝑧))
2120orcanai 1018 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → dom 𝑧 = suc dom 𝑧)
225adantr 486 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
23 aomclem5.a . . . . . . 7 (𝜑𝐴 ∈ On)
2423adantr 486 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → 𝐴 ∈ On)
25 aomclem5.za . . . . . . 7 (𝜑 → dom 𝑧𝐴)
2625adantr 486 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → dom 𝑧𝐴)
27 aomclem5.y . . . . . . 7 (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1𝐴)(𝑎 ≠ ∅ → (𝑦𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
2827adantr 486 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → ∀𝑎 ∈ 𝒫 (𝑅1𝐴)(𝑎 ≠ ∅ → (𝑦𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
2913, 14, 15, 16, 17, 21, 22, 24, 26, 28aomclem3 43900 . . . . 5 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → 𝐸 We (𝑅1‘dom 𝑧))
30 iffalse 4491 . . . . . . 7 (¬ dom 𝑧 = dom 𝑧 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐸)
3130adantl 487 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐸)
32 eqidd 2761 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
3331, 32weeq12d 5644 . . . . 5 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ 𝐸 We (𝑅1‘dom 𝑧)))
3429, 33mpbird 260 . . . 4 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
3512, 34pm2.61dan 825 . . 3 (𝜑 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
36 weinxp 5740 . . 3 (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
3735, 36sylib 221 . 2 (𝜑 → (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
38 aomclem5.g . . 3 𝐺 = (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧)))
39 weeq1 5642 . . 3 (𝐺 = (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) → (𝐺 We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧)))
4038, 39ax-mp 5 . 2 (𝐺 We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
4137, 40sylibr 237 1 (𝜑𝐺 We (𝑅1‘dom 𝑧))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wo 861   = wceq 1570  wcel 2145  wne 2955  wral 3076  wrex 3086  Vcvv 3450  cdif 3896  cin 3898  wss 3899  c0 4279  ifcif 4482  𝒫 cpw 4557  {csn 4584   cuni 4867   cint 4907   class class class wbr 5103  {copab 5167  cmpt 5186   E cep 5554   We wwe 5607   × cxp 5653  ccnv 5654  dom cdm 5655  ran crn 5656  cima 5658  Ord word 6356  Oncon0 6357  suc csuc 6359  cfv 6533  recscrecs 8360  Fincfn 8955  supcsup 9413  𝑅1cr1 9747  rankcrnk 9748
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8458  df-2o 8459  df-map 8831  df-en 8956  df-fin 8959  df-sup 9415  df-r1 9749  df-rank 9750
This theorem is used by:  aomclem6  43903
  Copyright terms: Public domain W3C validator