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

Theorem ordtypelem2 9427
Description: Lemma for ordtype 9440. (Contributed by Mario Carneiro, 24-Jun-2015.)
Hypotheses
Ref Expression
ordtypelem.1 𝐹 = recs(𝐺)
ordtypelem.2 𝐶 = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
ordtypelem.3 𝐺 = ( ∈ V ↦ (𝑣𝐶𝑢𝐶 ¬ 𝑢𝑅𝑣))
ordtypelem.5 𝑇 = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}
ordtypelem.6 𝑂 = OrdIso(𝑅, 𝐴)
ordtypelem.7 (𝜑𝑅 We 𝐴)
ordtypelem.8 (𝜑𝑅 Se 𝐴)
Assertion
Ref Expression
ordtypelem2 (𝜑 → Ord 𝑇)
Distinct variable groups:   𝑣,𝑢,𝐶   ,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧,𝑅   𝐴,,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧   𝑡,𝑂,𝑢,𝑣,𝑥   𝜑,𝑡,𝑥   ,𝐹,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧
Allowed substitution hints:   𝜑(𝑧,𝑤,𝑣,𝑢,,𝑗)   𝐶(𝑥,𝑧,𝑤,𝑡,,𝑗)   𝑇(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,,𝑗)   𝐺(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,,𝑗)   𝑂(𝑧,𝑤,,𝑗)

Proof of Theorem ordtypelem2
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 ordtypelem.5 . . . . . . . . . 10 𝑇 = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}
21ssrab3 4023 . . . . . . . . 9 𝑇 ⊆ On
32a1i 11 . . . . . . . 8 (𝜑𝑇 ⊆ On)
43sselda 3922 . . . . . . 7 ((𝜑𝑎𝑇) → 𝑎 ∈ On)
5 onss 7732 . . . . . . 7 (𝑎 ∈ On → 𝑎 ⊆ On)
64, 5syl 17 . . . . . 6 ((𝜑𝑎𝑇) → 𝑎 ⊆ On)
7 eloni 6327 . . . . . . . 8 (𝑎 ∈ On → Ord 𝑎)
84, 7syl 17 . . . . . . 7 ((𝜑𝑎𝑇) → Ord 𝑎)
9 imaeq2 6015 . . . . . . . . . . . 12 (𝑥 = 𝑎 → (𝐹𝑥) = (𝐹𝑎))
109raleqdv 3296 . . . . . . . . . . 11 (𝑥 = 𝑎 → (∀𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡 ↔ ∀𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡))
1110rexbidv 3162 . . . . . . . . . 10 (𝑥 = 𝑎 → (∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡 ↔ ∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡))
1211, 1elrab2 3638 . . . . . . . . 9 (𝑎𝑇 ↔ (𝑎 ∈ On ∧ ∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡))
1312simprbi 497 . . . . . . . 8 (𝑎𝑇 → ∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡)
1413adantl 481 . . . . . . 7 ((𝜑𝑎𝑇) → ∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡)
15 ordelss 6333 . . . . . . . . 9 ((Ord 𝑎𝑥𝑎) → 𝑥𝑎)
16 imass2 6061 . . . . . . . . 9 (𝑥𝑎 → (𝐹𝑥) ⊆ (𝐹𝑎))
17 ssralv 3991 . . . . . . . . . 10 ((𝐹𝑥) ⊆ (𝐹𝑎) → (∀𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡 → ∀𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡))
1817reximdv 3153 . . . . . . . . 9 ((𝐹𝑥) ⊆ (𝐹𝑎) → (∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡 → ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡))
1915, 16, 183syl 18 . . . . . . . 8 ((Ord 𝑎𝑥𝑎) → (∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡 → ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡))
2019ralrimdva 3138 . . . . . . 7 (Ord 𝑎 → (∃𝑡𝐴𝑧 ∈ (𝐹𝑎)𝑧𝑅𝑡 → ∀𝑥𝑎𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡))
218, 14, 20sylc 65 . . . . . 6 ((𝜑𝑎𝑇) → ∀𝑥𝑎𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡)
22 ssrab 4012 . . . . . 6 (𝑎 ⊆ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡} ↔ (𝑎 ⊆ On ∧ ∀𝑥𝑎𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡))
236, 21, 22sylanbrc 584 . . . . 5 ((𝜑𝑎𝑇) → 𝑎 ⊆ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡})
2423, 1sseqtrrdi 3964 . . . 4 ((𝜑𝑎𝑇) → 𝑎𝑇)
2524ralrimiva 3130 . . 3 (𝜑 → ∀𝑎𝑇 𝑎𝑇)
26 dftr3 5198 . . 3 (Tr 𝑇 ↔ ∀𝑎𝑇 𝑎𝑇)
2725, 26sylibr 234 . 2 (𝜑 → Tr 𝑇)
28 ordon 7724 . . 3 Ord On
29 trssord 6334 . . 3 ((Tr 𝑇𝑇 ⊆ On ∧ Ord On) → Ord 𝑇)
302, 28, 29mp3an23 1456 . 2 (Tr 𝑇 → Ord 𝑇)
3127, 30syl 17 1 (𝜑 → Ord 𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062  {crab 3390  Vcvv 3430  wss 3890   class class class wbr 5086  cmpt 5167  Tr wtr 5193   Se wse 5575   We wwe 5576  ran crn 5625  cima 5627  Ord word 6316  Oncon0 6317  crio 7316  recscrecs 8303  OrdIsocoi 9417
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-sep 5231  ax-pr 5370
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-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-tr 5194  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321
This theorem is referenced by:  ordtypelem5  9430  ordtypelem6  9431  ordtypelem7  9432  ordtypelem8  9433  ordtypelem9  9434
  Copyright terms: Public domain W3C validator