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 43015
Description: Lemma for dfac11 43019. 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 43014 . . . . 5 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → 𝐹 We (𝑅1‘dom 𝑧))
8 iftrue 4554 . . . . . . 7 (dom 𝑧 = dom 𝑧 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐹)
98adantl 481 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐹)
10 eqidd 2741 . . . . . 6 ((𝜑 ∧ dom 𝑧 = dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
119, 10weeq12d 5689 . . . . 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 6405 . . . . . . . 8 (dom 𝑧 ∈ On → Ord dom 𝑧)
19 orduniorsuc 7866 . . . . . . . 8 (Ord dom 𝑧 → (dom 𝑧 = dom 𝑧 ∨ dom 𝑧 = suc dom 𝑧))
202, 18, 193syl 18 . . . . . . 7 (𝜑 → (dom 𝑧 = dom 𝑧 ∨ dom 𝑧 = suc dom 𝑧))
2120orcanai 1003 . . . . . 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 43013 . . . . 5 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → 𝐸 We (𝑅1‘dom 𝑧))
30 iffalse 4557 . . . . . . 7 (¬ dom 𝑧 = dom 𝑧 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐸)
3130adantl 481 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) = 𝐸)
32 eqidd 2741 . . . . . 6 ((𝜑 ∧ ¬ dom 𝑧 = dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
3331, 32weeq12d 5689 . . . . 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 812 . . 3 (𝜑 → if(dom 𝑧 = dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
36 weinxp 5784 . . 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 5687 . . 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 846   = wceq 1537  wcel 2108  wne 2946  wral 3067  wrex 3076  Vcvv 3488  cdif 3973  cin 3975  wss 3976  c0 4352  ifcif 4548  𝒫 cpw 4622  {csn 4648   cuni 4931   cint 4970   class class class wbr 5166  {copab 5228  cmpt 5249   E cep 5598   We wwe 5651   × cxp 5698  ccnv 5699  dom cdm 5700  ran crn 5701  cima 5703  Ord word 6394  Oncon0 6395  suc csuc 6397  cfv 6573  recscrecs 8426  Fincfn 9003  supcsup 9509  𝑅1cr1 9831  rankcrnk 9832
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-tp 4653  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-isom 6582  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-2o 8523  df-map 8886  df-en 9004  df-fin 9007  df-sup 9511  df-r1 9833  df-rank 9834
This theorem is referenced by:  aomclem6  43016
  Copyright terms: Public domain W3C validator