Theorem aomclem5 41800

Description: Lemma for dfac11 41804. 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 482	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 ∈ On)
4		simpr 486	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 = ∪ dom 𝑧)
5		aomclem5.we	. . . . . . 7 ⊢ (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
6	5	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
7	1, 3, 4, 6	aomclem4 41799	. . . . 5 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → 𝐹 We (𝑅1‘dom 𝑧))
8		iftrue 4535	. . . . . . 7 ⊢ (dom 𝑧 = ∪ dom 𝑧 → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐹)
9	8	adantl 483	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐹)
10		eqidd 2734	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝑧 = ∪ dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
11	9, 10	weeq12d 41782	. . . . 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 482	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 ∈ On)
18		eloni 6375	. . . . . . . 8 ⊢ (dom 𝑧 ∈ On → Ord dom 𝑧)
19		orduniorsuc 7818	. . . . . . . 8 ⊢ (Ord dom 𝑧 → (dom 𝑧 = ∪ dom 𝑧 ∨ dom 𝑧 = suc ∪ dom 𝑧))
20	2, 18, 19	3syl 18	. . . . . . 7 ⊢ (𝜑 → (dom 𝑧 = ∪ dom 𝑧 ∨ dom 𝑧 = suc ∪ dom 𝑧))
21	20	orcanai 1002	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 = suc ∪ dom 𝑧)
22	5	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
23		aomclem5.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ On)
24	23	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → 𝐴 ∈ On)
25		aomclem5.za	. . . . . . 7 ⊢ (𝜑 → dom 𝑧 ⊆ 𝐴)
26	25	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → dom 𝑧 ⊆ 𝐴)
27		aomclem5.y	. . . . . . 7 ⊢ (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
28	27	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
29	13, 14, 15, 16, 17, 21, 22, 24, 26, 28	aomclem3 41798	. . . . 5 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → 𝐸 We (𝑅1‘dom 𝑧))
30		iffalse 4538	. . . . . . 7 ⊢ (¬ dom 𝑧 = ∪ dom 𝑧 → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐸)
31	30	adantl 483	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) = 𝐸)
32		eqidd 2734	. . . . . 6 ⊢ ((𝜑 ∧ ¬ dom 𝑧 = ∪ dom 𝑧) → (𝑅1‘dom 𝑧) = (𝑅1‘dom 𝑧))
33	31, 32	weeq12d 41782	. . . . 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 5761	. . 3 ⊢ (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) We (𝑅1‘dom 𝑧) ↔ (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
37	35, 36	sylib 217	. 2 ⊢ (𝜑 → (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧))) We (𝑅1‘dom 𝑧))
38		aomclem5.g	. . 3 ⊢ 𝐺 = (if(dom 𝑧 = ∪ dom 𝑧, 𝐹, 𝐸) ∩ ((𝑅1‘dom 𝑧) × (𝑅1‘dom 𝑧)))
39		weeq1 5665	. . 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 233	1 ⊢ (𝜑 → 𝐺 We (𝑅1‘dom 𝑧))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   ∨ wo 846   = wceq 1542   ∈ wcel 2107   ≠ wne 2941  ∀wral 3062  ∃wrex 3071  Vcvv 3475   ∖ cdif 3946   ∩ cin 3948   ⊆ wss 3949  ∅c0 4323  ifcif 4529  𝒫 cpw 4603  {csn 4629  ∪ cuni 4909  ∩ cint 4951   class class class wbr 5149  {copab 5211   ↦ cmpt 5232   E cep 5580   We wwe 5631   × cxp 5675  ^◡ccnv 5676  dom cdm 5677  ran crn 5678   “ cima 5680  Ord word 6364  Oncon0 6365  suc csuc 6367  ‘cfv 6544  recscrecs 8370  Fincfn 8939  supcsup 9435  𝑅₁cr1 9757  rankcrnk 9758

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-uni 4910  df-int 4952  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-isom 6553  df-riota 7365  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7856  df-1st 7975  df-2nd 7976  df-frecs 8266  df-wrecs 8297  df-recs 8371  df-rdg 8410  df-1o 8466  df-2o 8467  df-map 8822  df-en 8940  df-fin 8943  df-sup 9437  df-r1 9759  df-rank 9760

This theorem is referenced by:  aomclem6  41801