Theorem aomclem5 43049

Description: Lemma for dfac11 43053. 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

Step	Hyp	Ref	Expression
1		aomclem5.f	. . . . . 6 ⊢ 𝐹 = {⟨𝑎, 𝑏⟩ ∣ ((rank‘𝑎) E (rank‘𝑏) ∨ ((rank‘𝑎) = (rank‘𝑏) ∧ 𝑎(𝑧‘suc (rank‘𝑎))𝑏))}
2		aomclem5.on	. . . . . . 7 ⊢ (𝜑 → dom 𝑧 ∈ On)
3	2	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 ∈ On)
4		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 = ∪ dom 𝑧)
5		aomclem5.we	. . . . . . 7 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
6	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
7	1, 3, 4, 6	aomclem4 43048	. . . . 5 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → 𝐹 We (𝑅1‘dom 𝑧))
8		iftrue 4511	. . . . . . 7 ⊢ (dom 𝑧 = ∪ dom 𝑧 → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐹)
9	8	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐹)
10		eqidd 2737	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
11	9, 10	weeq12d 5648	. . . . 5 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ 𝐹 We (𝑅1‘dom 𝑧)))
12	7, 11	mpbird 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 ⊢ 𝐸 = {⟨𝑎, 𝑏⟩ ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})}
17	2	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 ∈ On)
18		eloni 6367	. . . . . . . 8 ⊢ (dom 𝑧 ∈ On → Ord dom 𝑧)
19		orduniorsuc 7829	. . . . . . . 8 ⊢ (Ord dom 𝑧 → (dom 𝑧 = ∪ dom 𝑧 ∨ dom 𝑧 = suc ∪ dom 𝑧))
20	2, 18, 19	3syl 18	. . . . . . 7 ⊢ (𝜑 → (dom 𝑧 = ∪ dom 𝑧 ∨ dom 𝑧 = suc ∪ dom 𝑧))
21	20	orcanai 1004	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 = suc ∪ dom 𝑧)
22	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
23		aomclem5.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ On)
24	23	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → 𝐴 ∈ On)
25		aomclem5.za	. . . . . . 7 ⊢ (𝜑 → dom 𝑧 ⊆ 𝐴)
26	25	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 ⊆ 𝐴)
27		aomclem5.y	. . . . . . 7 ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
28	27	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
29	13, 14, 15, 16, 17, 21, 22, 24, 26, 28	aomclem3 43047	. . . . 5 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → 𝐸 We (𝑅1‘dom 𝑧))
30		iffalse 4514	. . . . . . 7 ⊢ (¬ dom 𝑧 = ∪ dom 𝑧 → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐸)
31	30	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐸)
32		eqidd 2737	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
33	31, 32	weeq12d 5648	. . . . 5 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ 𝐸 We (𝑅1‘dom 𝑧)))
34	29, 33	mpbird 257	. . . 4 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
35	12, 34	pm2.61dan 812	. . 3 ⊢ (𝜑 → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧))
36		weinxp 5744	. . 3 ⊢ (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
37	35, 36	sylib 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 5646	. . 3 ⊢ (𝐺 = (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) → (𝐺 We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧)))
40	38, 39	ax-mp 5	. 2 ⊢ (𝐺 We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
41	37, 40	sylibr 234	1 ⊢ (𝜑 → 𝐺 We (𝑅1‘dom 𝑧))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109   ≠ wne 2933  ∀wral 3052  ∃wrex 3061  Vcvv 3464   ∖ cdif 3928   ∩ cin 3930   ⊆ wss 3931  ∅c0 4313  ifcif 4505  𝒫 cpw 4580  {csn 4606  ∪ cuni 4888  ∩ cint 4927   class class class wbr 5124  {copab 5186   ↦ cmpt 5206   E cep 5557   We wwe 5610   × cxp 5657  ^◡ccnv 5658  dom cdm 5659  ran crn 5660   “ cima 5662  Ord word 6356  Oncon0 6357  suc csuc 6359  ‘cfv 6536  recscrecs 8389  Fincfn 8964  supcsup 9457  𝑅₁cr1 9781  rankcrnk 9782

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-tp 4611  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7867  df-1st 7993  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-1o 8485  df-2o 8486  df-map 8847  df-en 8965  df-fin 8968  df-sup 9459  df-r1 9783  df-rank 9784

This theorem is referenced by:  aomclem6  43050