Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfac12lem3 Structured version   Visualization version   GIF version

Theorem dfac12lem3 8850
 Description: Lemma for dfac12 8854. (Contributed by Mario Carneiro, 29-May-2015.)
Hypotheses
Ref Expression
dfac12.1 (𝜑𝐴 ∈ On)
dfac12.3 (𝜑𝐹:𝒫 (har‘(𝑅1𝐴))–1-1→On)
dfac12.4 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = dom 𝑥, ((suc ran ran 𝑥 ·𝑜 (rank‘𝑦)) +𝑜 ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦))))))
Assertion
Ref Expression
dfac12lem3 (𝜑 → (𝑅1𝐴) ∈ dom card)
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦,𝐺   𝜑,𝑦   𝑥,𝐹,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)

Proof of Theorem dfac12lem3
Dummy variables 𝑚 𝑛 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6113 . . . 4 (𝐺𝐴) ∈ V
21rnex 6992 . . 3 ran (𝐺𝐴) ∈ V
3 ssid 3587 . . . . 5 𝐴𝐴
4 dfac12.1 . . . . . 6 (𝜑𝐴 ∈ On)
5 sseq1 3589 . . . . . . . . 9 (𝑚 = 𝑛 → (𝑚𝐴𝑛𝐴))
6 fveq2 6103 . . . . . . . . . . 11 (𝑚 = 𝑛 → (𝐺𝑚) = (𝐺𝑛))
7 f1eq1 6009 . . . . . . . . . . 11 ((𝐺𝑚) = (𝐺𝑛) → ((𝐺𝑚):(𝑅1𝑚)–1-1→On ↔ (𝐺𝑛):(𝑅1𝑚)–1-1→On))
86, 7syl 17 . . . . . . . . . 10 (𝑚 = 𝑛 → ((𝐺𝑚):(𝑅1𝑚)–1-1→On ↔ (𝐺𝑛):(𝑅1𝑚)–1-1→On))
9 fveq2 6103 . . . . . . . . . . 11 (𝑚 = 𝑛 → (𝑅1𝑚) = (𝑅1𝑛))
10 f1eq2 6010 . . . . . . . . . . 11 ((𝑅1𝑚) = (𝑅1𝑛) → ((𝐺𝑛):(𝑅1𝑚)–1-1→On ↔ (𝐺𝑛):(𝑅1𝑛)–1-1→On))
119, 10syl 17 . . . . . . . . . 10 (𝑚 = 𝑛 → ((𝐺𝑛):(𝑅1𝑚)–1-1→On ↔ (𝐺𝑛):(𝑅1𝑛)–1-1→On))
128, 11bitrd 267 . . . . . . . . 9 (𝑚 = 𝑛 → ((𝐺𝑚):(𝑅1𝑚)–1-1→On ↔ (𝐺𝑛):(𝑅1𝑛)–1-1→On))
135, 12imbi12d 333 . . . . . . . 8 (𝑚 = 𝑛 → ((𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On) ↔ (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On)))
1413imbi2d 329 . . . . . . 7 (𝑚 = 𝑛 → ((𝜑 → (𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On)) ↔ (𝜑 → (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On))))
15 sseq1 3589 . . . . . . . . 9 (𝑚 = 𝐴 → (𝑚𝐴𝐴𝐴))
16 fveq2 6103 . . . . . . . . . . 11 (𝑚 = 𝐴 → (𝐺𝑚) = (𝐺𝐴))
17 f1eq1 6009 . . . . . . . . . . 11 ((𝐺𝑚) = (𝐺𝐴) → ((𝐺𝑚):(𝑅1𝑚)–1-1→On ↔ (𝐺𝐴):(𝑅1𝑚)–1-1→On))
1816, 17syl 17 . . . . . . . . . 10 (𝑚 = 𝐴 → ((𝐺𝑚):(𝑅1𝑚)–1-1→On ↔ (𝐺𝐴):(𝑅1𝑚)–1-1→On))
19 fveq2 6103 . . . . . . . . . . 11 (𝑚 = 𝐴 → (𝑅1𝑚) = (𝑅1𝐴))
20 f1eq2 6010 . . . . . . . . . . 11 ((𝑅1𝑚) = (𝑅1𝐴) → ((𝐺𝐴):(𝑅1𝑚)–1-1→On ↔ (𝐺𝐴):(𝑅1𝐴)–1-1→On))
2119, 20syl 17 . . . . . . . . . 10 (𝑚 = 𝐴 → ((𝐺𝐴):(𝑅1𝑚)–1-1→On ↔ (𝐺𝐴):(𝑅1𝐴)–1-1→On))
2218, 21bitrd 267 . . . . . . . . 9 (𝑚 = 𝐴 → ((𝐺𝑚):(𝑅1𝑚)–1-1→On ↔ (𝐺𝐴):(𝑅1𝐴)–1-1→On))
2315, 22imbi12d 333 . . . . . . . 8 (𝑚 = 𝐴 → ((𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On) ↔ (𝐴𝐴 → (𝐺𝐴):(𝑅1𝐴)–1-1→On)))
2423imbi2d 329 . . . . . . 7 (𝑚 = 𝐴 → ((𝜑 → (𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On)) ↔ (𝜑 → (𝐴𝐴 → (𝐺𝐴):(𝑅1𝐴)–1-1→On))))
25 r19.21v 2943 . . . . . . . 8 (∀𝑛𝑚 (𝜑 → (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On)) ↔ (𝜑 → ∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On)))
26 eloni 5650 . . . . . . . . . . . . . . . . . 18 (𝑚 ∈ On → Ord 𝑚)
2726ad2antrl 760 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) → Ord 𝑚)
28 ordelss 5656 . . . . . . . . . . . . . . . . 17 ((Ord 𝑚𝑛𝑚) → 𝑛𝑚)
2927, 28sylan 487 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ 𝑛𝑚) → 𝑛𝑚)
30 simplrr 797 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ 𝑛𝑚) → 𝑚𝐴)
3129, 30sstrd 3578 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ 𝑛𝑚) → 𝑛𝐴)
32 pm5.5 350 . . . . . . . . . . . . . . 15 (𝑛𝐴 → ((𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) ↔ (𝐺𝑛):(𝑅1𝑛)–1-1→On))
3331, 32syl 17 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ 𝑛𝑚) → ((𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) ↔ (𝐺𝑛):(𝑅1𝑛)–1-1→On))
3433ralbidva 2968 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) → (∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) ↔ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On))
354ad2antrr 758 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → 𝐴 ∈ On)
36 dfac12.3 . . . . . . . . . . . . . . . 16 (𝜑𝐹:𝒫 (har‘(𝑅1𝐴))–1-1→On)
3736ad2antrr 758 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → 𝐹:𝒫 (har‘(𝑅1𝐴))–1-1→On)
38 dfac12.4 . . . . . . . . . . . . . . 15 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = dom 𝑥, ((suc ran ran 𝑥 ·𝑜 (rank‘𝑦)) +𝑜 ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦))))))
39 simplrl 796 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → 𝑚 ∈ On)
40 eqid 2610 . . . . . . . . . . . . . . 15 (OrdIso( E , ran (𝐺 𝑚)) ∘ (𝐺 𝑚)) = (OrdIso( E , ran (𝐺 𝑚)) ∘ (𝐺 𝑚))
41 simplrr 797 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → 𝑚𝐴)
42 simpr 476 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On)
43 fveq2 6103 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑧 → (𝐺𝑛) = (𝐺𝑧))
44 f1eq1 6009 . . . . . . . . . . . . . . . . . . 19 ((𝐺𝑛) = (𝐺𝑧) → ((𝐺𝑛):(𝑅1𝑛)–1-1→On ↔ (𝐺𝑧):(𝑅1𝑛)–1-1→On))
4543, 44syl 17 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑧 → ((𝐺𝑛):(𝑅1𝑛)–1-1→On ↔ (𝐺𝑧):(𝑅1𝑛)–1-1→On))
46 fveq2 6103 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑧 → (𝑅1𝑛) = (𝑅1𝑧))
47 f1eq2 6010 . . . . . . . . . . . . . . . . . . 19 ((𝑅1𝑛) = (𝑅1𝑧) → ((𝐺𝑧):(𝑅1𝑛)–1-1→On ↔ (𝐺𝑧):(𝑅1𝑧)–1-1→On))
4846, 47syl 17 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑧 → ((𝐺𝑧):(𝑅1𝑛)–1-1→On ↔ (𝐺𝑧):(𝑅1𝑧)–1-1→On))
4945, 48bitrd 267 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑧 → ((𝐺𝑛):(𝑅1𝑛)–1-1→On ↔ (𝐺𝑧):(𝑅1𝑧)–1-1→On))
5049cbvralv 3147 . . . . . . . . . . . . . . . 16 (∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On ↔ ∀𝑧𝑚 (𝐺𝑧):(𝑅1𝑧)–1-1→On)
5142, 50sylib 207 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → ∀𝑧𝑚 (𝐺𝑧):(𝑅1𝑧)–1-1→On)
5235, 37, 38, 39, 40, 41, 51dfac12lem2 8849 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) ∧ ∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On) → (𝐺𝑚):(𝑅1𝑚)–1-1→On)
5352ex 449 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) → (∀𝑛𝑚 (𝐺𝑛):(𝑅1𝑛)–1-1→On → (𝐺𝑚):(𝑅1𝑚)–1-1→On))
5434, 53sylbid 229 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚𝐴)) → (∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) → (𝐺𝑚):(𝑅1𝑚)–1-1→On))
5554expr 641 . . . . . . . . . . 11 ((𝜑𝑚 ∈ On) → (𝑚𝐴 → (∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) → (𝐺𝑚):(𝑅1𝑚)–1-1→On)))
5655com23 84 . . . . . . . . . 10 ((𝜑𝑚 ∈ On) → (∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) → (𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On)))
5756expcom 450 . . . . . . . . 9 (𝑚 ∈ On → (𝜑 → (∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On) → (𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On))))
5857a2d 29 . . . . . . . 8 (𝑚 ∈ On → ((𝜑 → ∀𝑛𝑚 (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On)) → (𝜑 → (𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On))))
5925, 58syl5bi 231 . . . . . . 7 (𝑚 ∈ On → (∀𝑛𝑚 (𝜑 → (𝑛𝐴 → (𝐺𝑛):(𝑅1𝑛)–1-1→On)) → (𝜑 → (𝑚𝐴 → (𝐺𝑚):(𝑅1𝑚)–1-1→On))))
6014, 24, 59tfis3 6949 . . . . . 6 (𝐴 ∈ On → (𝜑 → (𝐴𝐴 → (𝐺𝐴):(𝑅1𝐴)–1-1→On)))
614, 60mpcom 37 . . . . 5 (𝜑 → (𝐴𝐴 → (𝐺𝐴):(𝑅1𝐴)–1-1→On))
623, 61mpi 20 . . . 4 (𝜑 → (𝐺𝐴):(𝑅1𝐴)–1-1→On)
63 f1f 6014 . . . 4 ((𝐺𝐴):(𝑅1𝐴)–1-1→On → (𝐺𝐴):(𝑅1𝐴)⟶On)
64 frn 5966 . . . 4 ((𝐺𝐴):(𝑅1𝐴)⟶On → ran (𝐺𝐴) ⊆ On)
6562, 63, 643syl 18 . . 3 (𝜑 → ran (𝐺𝐴) ⊆ On)
66 onssnum 8746 . . 3 ((ran (𝐺𝐴) ∈ V ∧ ran (𝐺𝐴) ⊆ On) → ran (𝐺𝐴) ∈ dom card)
672, 65, 66sylancr 694 . 2 (𝜑 → ran (𝐺𝐴) ∈ dom card)
68 f1f1orn 6061 . . . 4 ((𝐺𝐴):(𝑅1𝐴)–1-1→On → (𝐺𝐴):(𝑅1𝐴)–1-1-onto→ran (𝐺𝐴))
6962, 68syl 17 . . 3 (𝜑 → (𝐺𝐴):(𝑅1𝐴)–1-1-onto→ran (𝐺𝐴))
70 fvex 6113 . . . 4 (𝑅1𝐴) ∈ V
7170f1oen 7862 . . 3 ((𝐺𝐴):(𝑅1𝐴)–1-1-onto→ran (𝐺𝐴) → (𝑅1𝐴) ≈ ran (𝐺𝐴))
72 ennum 8656 . . 3 ((𝑅1𝐴) ≈ ran (𝐺𝐴) → ((𝑅1𝐴) ∈ dom card ↔ ran (𝐺𝐴) ∈ dom card))
7369, 71, 723syl 18 . 2 (𝜑 → ((𝑅1𝐴) ∈ dom card ↔ ran (𝐺𝐴) ∈ dom card))
7467, 73mpbird 246 1 (𝜑 → (𝑅1𝐴) ∈ dom card)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  Vcvv 3173   ⊆ wss 3540  ifcif 4036  𝒫 cpw 4108  ∪ cuni 4372   class class class wbr 4583   ↦ cmpt 4643   E cep 4947  ◡ccnv 5037  dom cdm 5038  ran crn 5039   “ cima 5041   ∘ ccom 5042  Ord word 5639  Oncon0 5640  suc csuc 5642  ⟶wf 5800  –1-1→wf1 5801  –1-1-onto→wf1o 5803  ‘cfv 5804  (class class class)co 6549  recscrecs 7354   +𝑜 coa 7444   ·𝑜 comu 7445   ≈ cen 7838  OrdIsocoi 8297  harchar 8344  𝑅1cr1 8508  rankcrnk 8509  cardccrd 8644 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-oadd 7451  df-omul 7452  df-er 7629  df-en 7842  df-dom 7843  df-oi 8298  df-har 8346  df-r1 8510  df-rank 8511  df-card 8648 This theorem is referenced by:  dfac12r  8851
 Copyright terms: Public domain W3C validator