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

Theorem grothomex 10895
Description: The Tarski-Grothendieck Axiom implies the Axiom of Infinity (in the form of omex 9628). Note that our proof depends on neither the Axiom of Infinity nor Regularity. (Contributed by Mario Carneiro, 19-Apr-2013.) Use omex 9628 instead. (New usage is discouraged.)
Assertion
Ref Expression
grothomex ω ∈ V

Proof of Theorem grothomex
Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 r111 9765 . . . 4 𝑅1:On–1-1→V
2 omsson 7870 . . . 4 ω ⊆ On
3 f1ores 6831 . . . 4 ((𝑅1:On–1-1→V ∧ ω ⊆ On) → (𝑅1 ↾ ω):ω–1-1-onto→(𝑅1 “ ω))
41, 2, 3mp2an 705 . . 3 (𝑅1 ↾ ω):ω–1-1-onto→(𝑅1 “ ω)
5 f1of1 6815 . . 3 ((𝑅1 ↾ ω):ω–1-1-onto→(𝑅1 “ ω) → (𝑅1 ↾ ω):ω–1-1→(𝑅1 “ ω))
64, 5ax-mp 5 . 2 (𝑅1 ↾ ω):ω–1-1→(𝑅1 “ ω)
7 r1fnon 9757 . . . . . . . 8 𝑅1 Fn On
8 fvelimab 6949 . . . . . . . 8 ((𝑅1 Fn On ∧ ω ⊆ On) → (𝑤 ∈ (𝑅1 “ ω) ↔ ∃𝑥 ∈ ω (𝑅1‘𝑥) = 𝑤))
97, 2, 8mp2an 705 . . . . . . 7 (𝑤 ∈ (𝑅1 “ ω) ↔ ∃𝑥 ∈ ω (𝑅1‘𝑥) = 𝑤)
10 fveq2 6877 . . . . . . . . . . 11 (𝑥 = ∅ → (𝑅1‘𝑥) = (𝑅1‘∅))
1110eleq1d 2846 . . . . . . . . . 10 (𝑥 = ∅ → ((𝑅1‘𝑥) ∈ 𝑦 ↔ (𝑅1‘∅) ∈ 𝑦))
12 fveq2 6877 . . . . . . . . . . 11 (𝑥 = 𝑤 → (𝑅1‘𝑥) = (𝑅1‘𝑤))
1312eleq1d 2846 . . . . . . . . . 10 (𝑥 = 𝑤 → ((𝑅1‘𝑥) ∈ 𝑦 ↔ (𝑅1‘𝑤) ∈ 𝑦))
14 fveq2 6877 . . . . . . . . . . 11 (𝑥 = suc 𝑤 → (𝑅1‘𝑥) = (𝑅1‘suc 𝑤))
1514eleq1d 2846 . . . . . . . . . 10 (𝑥 = suc 𝑤 → ((𝑅1‘𝑥) ∈ 𝑦 ↔ (𝑅1‘suc 𝑤) ∈ 𝑦))
16 r10 9758 . . . . . . . . . . . 12 (𝑅1‘∅) = ∅
1716eleq1i 2852 . . . . . . . . . . 11 ((𝑅1‘∅) ∈ 𝑦 ↔ ∅ ∈ 𝑦)
1817biranri 511 . . . . . . . . . 10 ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → (𝑅1‘∅) ∈ 𝑦)
19 pweq 4571 . . . . . . . . . . . . . . 15 (𝑧 = (𝑅1‘𝑤) → 𝒫 𝑧 = 𝒫 (𝑅1‘𝑤))
2019eleq1d 2846 . . . . . . . . . . . . . 14 (𝑧 = (𝑅1‘𝑤) → (𝒫 𝑧 ∈ 𝑦 ↔ 𝒫 (𝑅1‘𝑤) ∈ 𝑦))
2120rspccv 3574 . . . . . . . . . . . . 13 (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 → ((𝑅1‘𝑤) ∈ 𝑦 → 𝒫 (𝑅1‘𝑤) ∈ 𝑦))
22 nnon 7872 . . . . . . . . . . . . . . . 16 (𝑤 ∈ ω → 𝑤 ∈ On)
23 r1suc 9760 . . . . . . . . . . . . . . . 16 (𝑤 ∈ On → (𝑅1‘suc 𝑤) = 𝒫 (𝑅1‘𝑤))
2422, 23syl 18 . . . . . . . . . . . . . . 15 (𝑤 ∈ ω → (𝑅1‘suc 𝑤) = 𝒫 (𝑅1‘𝑤))
2524eleq1d 2846 . . . . . . . . . . . . . 14 (𝑤 ∈ ω → ((𝑅1‘suc 𝑤) ∈ 𝑦 ↔ 𝒫 (𝑅1‘𝑤) ∈ 𝑦))
2625biimprcd 253 . . . . . . . . . . . . 13 (𝒫 (𝑅1‘𝑤) ∈ 𝑦 → (𝑤 ∈ ω → (𝑅1‘suc 𝑤) ∈ 𝑦))
2721, 26syl6 36 . . . . . . . . . . . 12 (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 → ((𝑅1‘𝑤) ∈ 𝑦 → (𝑤 ∈ ω → (𝑅1‘suc 𝑤) ∈ 𝑦)))
2827com3r 88 . . . . . . . . . . 11 (𝑤 ∈ ω → (∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦 → ((𝑅1‘𝑤) ∈ 𝑦 → (𝑅1‘suc 𝑤) ∈ 𝑦)))
2928adantld 496 . . . . . . . . . 10 (𝑤 ∈ ω → ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → ((𝑅1‘𝑤) ∈ 𝑦 → (𝑅1‘suc 𝑤) ∈ 𝑦)))
3011, 13, 15, 18, 29finds2 7899 . . . . . . . . 9 (𝑥 ∈ ω → ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → (𝑅1‘𝑥) ∈ 𝑦))
31 eleq1 2849 . . . . . . . . . 10 ((𝑅1‘𝑥) = 𝑤 → ((𝑅1‘𝑥) ∈ 𝑦 ↔ 𝑤 ∈ 𝑦))
3231biimpd 232 . . . . . . . . 9 ((𝑅1‘𝑥) = 𝑤 → ((𝑅1‘𝑥) ∈ 𝑦 → 𝑤 ∈ 𝑦))
3330, 32syl9 78 . . . . . . . 8 (𝑥 ∈ ω → ((𝑅1‘𝑥) = 𝑤 → ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → 𝑤 ∈ 𝑦)))
3433rexlimiv 3157 . . . . . . 7 (∃𝑥 ∈ ω (𝑅1‘𝑥) = 𝑤 → ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → 𝑤 ∈ 𝑦))
359, 34sylbi 220 . . . . . 6 (𝑤 ∈ (𝑅1 “ ω) → ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → 𝑤 ∈ 𝑦))
3635com12 33 . . . . 5 ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → (𝑤 ∈ (𝑅1 “ ω) → 𝑤 ∈ 𝑦))
3736ssrdv 3937 . . . 4 ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → (𝑅1 “ ω) ⊆ 𝑦)
38 vex 3455 . . . . 5 𝑦 ∈ V
3938ssex 5282 . . . 4 ((𝑅1 “ ω) ⊆ 𝑦 → (𝑅1 “ ω) ∈ V)
4037, 39syl 18 . . 3 ((∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) → (𝑅1 “ ω) ∈ V)
41 0ex 5261 . . . 4 ∅ ∈ V
42 eleq1 2849 . . . . . 6 (𝑥 = ∅ → (𝑥 ∈ 𝑦 ↔ ∅ ∈ 𝑦))
4342anbi1d 643 . . . . 5 (𝑥 = ∅ → ((𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) ↔ (∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦)))
4443exbidv 1954 . . . 4 (𝑥 = ∅ → (∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦) ↔ ∃𝑦(∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦)))
45 axgroth6 10894 . . . . 5 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦))
46 simpr 490 . . . . . . . 8 ((𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) → 𝒫 𝑧 ∈ 𝑦)
4746ralimi 3100 . . . . . . 7 (∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) → ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦)
4847anim2i 629 . . . . . 6 ((𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦)) → (𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦))
49483adant3 1150 . . . . 5 ((𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 (𝒫 𝑧 ⊆ 𝑦 ∧ 𝒫 𝑧 ∈ 𝑦) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧 ≺ 𝑦 → 𝑧 ∈ 𝑦)) → (𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦))
5045, 49eximii 1870 . . . 4 ∃𝑦(𝑥 ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦)
5141, 44, 50vtocl 3521 . . 3 ∃𝑦(∅ ∈ 𝑦 ∧ ∀𝑧 ∈ 𝑦 𝒫 𝑧 ∈ 𝑦)
5240, 51exlimiiv 1964 . 2 (𝑅1 “ ω) ∈ V
53 f1dmex 7958 . 2 (((𝑅1 ↾ ω):ω–1-1→(𝑅1 “ ω) ∧ (𝑅1 “ ω) ∈ V) → ω ∈ V)
546, 52, 53mp2an 705 1 ω ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557   class class class wbr 5103   ↾ cres 5653   “ cima 5654  Oncon0 6355  suc csuc 6357   Fn wfn 6526  –1-1→wf1 6528  –1-1-onto→wf1o 6530  ‘cfv 6531  ωcom 7866   ≺ csdm 8956  𝑅1cr1 9750
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-groth 10889
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-r1 9752
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator