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 43336
Description: Lemma for dfac11 43340. 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 480 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → dom 𝑧 ∈ On)
4 simpr 484 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → dom 𝑧 = dom 𝑧)
5 aomclem5.we . . . . . . 7 (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
65adantr 480 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
71, 3, 4, 6aomclem4 43335 . . . . 5 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → 𝐹 We (𝑅1‘dom 𝑧))
8 iftrue 4486 . . . . . . 7 (dom 𝑧 = dom 𝑧 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐹)
98adantl 481 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐹)
10 eqidd 2738 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
119, 10weeq12d 5614 . . . . 5 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ 𝐹 We (𝑅1‘dom 𝑧)))
127, 11mpbird 257 . . . 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 480 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → dom 𝑧 ∈ On)
18 eloni 6328 . . . . . . . 8 (dom 𝑧 ∈ On → Ord dom 𝑧)
19 orduniorsuc 7774 . . . . . . . 8 (Ord dom 𝑧 → (dom 𝑧 = dom 𝑧 ∨ dom 𝑧 = suc dom 𝑧))
202, 18, 193syl 18 . . . . . . 7 (𝜑 → (dom 𝑧 = dom 𝑧 ∨ dom 𝑧 = suc dom 𝑧))
2120orcanai 1005 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → dom 𝑧 = suc dom 𝑧)
225adantr 480 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧𝑎) We (𝑅1𝑎))
23 aomclem5.a . . . . . . 7 (𝜑𝐴 ∈ On)
2423adantr 480 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → 𝐴 ∈ On)
25 aomclem5.za . . . . . . 7 (𝜑 → dom 𝑧𝐴)
2625adantr 480 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → dom 𝑧𝐴)
27 aomclem5.y . . . . . . 7 (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1𝐴)(𝑎 ≠ ∅ → (𝑦𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
2827adantr 480 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → ∀𝑎 ∈ 𝒫 (𝑅1𝐴)(𝑎 ≠ ∅ → (𝑦𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
2913, 14, 15, 16, 17, 21, 22, 24, 26, 28aomclem3 43334 . . . . 5 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → 𝐸 We (𝑅1‘dom 𝑧))
30 iffalse 4489 . . . . . . 7 (¬ dom 𝑧 = dom 𝑧 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐸)
3130adantl 481 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐸)
32 eqidd 2738 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
3331, 32weeq12d 5614 . . . . 5 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ 𝐸 We (𝑅1‘dom 𝑧)))
3429, 33mpbird 257 . . . 4 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
3512, 34pm2.61dan 813 . . 3 (𝜑 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
36 weinxp 5710 . . 3 (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
3735, 36sylib 218 . 2 (𝜑 → (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
38 aomclem5.g . . 3 𝐺 = (if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧)))
39 weeq1 5612 . . 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 234 1 (𝜑𝐺 We (𝑅1‘dom 𝑧))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848   = wceq 1542  wcel 2114  wne 2933  wral 3052  wrex 3061  Vcvv 3441  cdif 3899  cin 3901  wss 3902  c0 4286  ifcif 4480  𝒫 cpw 4555  {csn 4581   cuni 4864   cint 4903   class class class wbr 5099  {copab 5161  cmpt 5180   E cep 5524   We wwe 5577   × cxp 5623  ccnv 5624  dom cdm 5625  ran crn 5626  cima 5628  Ord word 6317  Oncon0 6318  suc csuc 6320  cfv 6493  recscrecs 8304  Fincfn 8887  supcsup 9347  𝑅1cr1 9678  rankcrnk 9679
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-2o 8400  df-map 8769  df-en 8888  df-fin 8891  df-sup 9349  df-r1 9680  df-rank 9681
This theorem is referenced by:  aomclem6  43337
  Copyright terms: Public domain W3C validator