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

Theorem zorn2lem1 10574
Description: Lemma for zorn2 10584. (Contributed by NM, 3-Apr-1997.) (Revised by Mario Carneiro, 9-May-2015.)
Hypotheses
Ref Expression
zorn2lem.3 𝐹 = recs((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣)))
zorn2lem.4 𝐶 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧}
zorn2lem.5 𝐷 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧}
Assertion
Ref Expression
zorn2lem1 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) ∈ 𝐷)
Distinct variable groups:   𝑓,𝑔,𝑢,𝑣,𝑤,𝑥,𝑧,𝐴   𝐷,𝑓,𝑢,𝑣   𝑓,𝐹,𝑔,𝑢,𝑣,𝑥,𝑧   𝑅,𝑓,𝑔,𝑢,𝑣,𝑤,𝑥,𝑧   𝑣,𝐶
Allowed substitution hints:   𝐶(𝑥, 𝑧, 𝑤, 𝑢, 𝑓, 𝑔)   𝐷(𝑥, 𝑧, 𝑤, 𝑔)   𝐹(𝑤)

Proof of Theorem zorn2lem1
StepHypRef Expression
1 zorn2lem.3 . . . . 5 𝐹 = recs((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣)))
21tfr2 8406 . . . 4 (𝑥 ∈ On → (𝐹‘𝑥) = ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)))
32adantr 486 . . 3 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) = ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)))
41tfr1 8405 . . . . . 6 𝐹 Fn On
5 fnfun 6639 . . . . . 6 (𝐹 Fn On → Fun 𝐹)
64, 5ax-mp 5 . . . . 5 Fun 𝐹
7 vex 3455 . . . . 5 𝑥 ∈ V
8 resfunexg 7221 . . . . 5 ((Fun 𝐹 ∧ 𝑥 ∈ V) → (𝐹 ↾ 𝑥) ∈ V)
96, 7, 8mp2an 705 . . . 4 (𝐹 ↾ 𝑥) ∈ V
10 rneq 5918 . . . . . . . . . . . 12 (𝑓 = (𝐹 ↾ 𝑥) → ran 𝑓 = ran (𝐹 ↾ 𝑥))
11 df-ima 5664 . . . . . . . . . . . 12 (𝐹 “ 𝑥) = ran (𝐹 ↾ 𝑥)
1210, 11eqtr4di 2814 . . . . . . . . . . 11 (𝑓 = (𝐹 ↾ 𝑥) → ran 𝑓 = (𝐹 “ 𝑥))
1312eleq2d 2847 . . . . . . . . . 10 (𝑓 = (𝐹 ↾ 𝑥) → (𝑔 ∈ ran 𝑓 ↔ 𝑔 ∈ (𝐹 “ 𝑥)))
1413imbi1d 344 . . . . . . . . 9 (𝑓 = (𝐹 ↾ 𝑥) → ((𝑔 ∈ ran 𝑓 → 𝑔𝑅𝑧) ↔ (𝑔 ∈ (𝐹 “ 𝑥) → 𝑔𝑅𝑧)))
1514ralbidv2 3182 . . . . . . . 8 (𝑓 = (𝐹 ↾ 𝑥) → (∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧 ↔ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧))
1615rabbidv 3420 . . . . . . 7 (𝑓 = (𝐹 ↾ 𝑥) → {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧} = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧})
17 zorn2lem.4 . . . . . . 7 𝐶 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧}
18 zorn2lem.5 . . . . . . 7 𝐷 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧}
1916, 17, 183eqtr4g 2821 . . . . . 6 (𝑓 = (𝐹 ↾ 𝑥) → 𝐶 = 𝐷)
2019eleq2d 2847 . . . . . . . 8 (𝑓 = (𝐹 ↾ 𝑥) → (𝑢 ∈ 𝐶 ↔ 𝑢 ∈ 𝐷))
2120imbi1d 344 . . . . . . 7 (𝑓 = (𝐹 ↾ 𝑥) → ((𝑢 ∈ 𝐶 → ¬ 𝑢𝑤𝑣) ↔ (𝑢 ∈ 𝐷 → ¬ 𝑢𝑤𝑣)))
2221ralbidv2 3182 . . . . . 6 (𝑓 = (𝐹 ↾ 𝑥) → (∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣 ↔ ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
2319, 22riotaeqbidv 7380 . . . . 5 (𝑓 = (𝐹 ↾ 𝑥) → (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
24 eqid 2761 . . . . 5 (𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣)) = (𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))
25 riotaex 7381 . . . . 5 (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣) ∈ V
2623, 24, 25fvmpt 6993 . . . 4 ((𝐹 ↾ 𝑥) ∈ V → ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
279, 26ax-mp 5 . . 3 ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣)
283, 27eqtrdi 2812 . 2 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
29 simprl 783 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝑤 We 𝐴)
30 weso 5642 . . . . . . 7 (𝑤 We 𝐴 → 𝑤 Or 𝐴)
3130ad2antrl 741 . . . . . 6 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝑤 Or 𝐴)
32 vex 3455 . . . . . 6 𝑤 ∈ V
33 soex 7933 . . . . . 6 ((𝑤 Or 𝐴 ∧ 𝑤 ∈ V) → 𝐴 ∈ V)
3431, 32, 33sylancl 598 . . . . 5 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐴 ∈ V)
3518, 34rabexd 5301 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐷 ∈ V)
3618ssrab3 4030 . . . . 5 𝐷 ⊆ 𝐴
3736a1i 11 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐷 ⊆ 𝐴)
38 simprr 785 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐷 ≠ ∅)
39 wereu 5647 . . . 4 ((𝑤 We 𝐴 ∧ (𝐷 ∈ V ∧ 𝐷 ⊆ 𝐴 ∧ 𝐷 ≠ ∅)) → ∃!𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣)
4029, 35, 37, 38, 39syl13anc 1399 . . 3 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → ∃!𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣)
41 riotacl 7394 . . 3 (∃!𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣 → (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣) ∈ 𝐷)
4240, 41syl 18 . 2 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣) ∈ 𝐷)
4328, 42eqeltrd 2861 1 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) ∈ 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃!wreu 3364  {crab 3413  Vcvv 3451   ⊆ wss 3899  ∅c0 4279   class class class wbr 5103   ↦ cmpt 5186   Or wor 5558   We wwe 5603  ran crn 5652   ↾ cres 5653   “ cima 5654  Oncon0 6362  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538  ℩crio 7376  recscrecs 8378
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-pr 5391  ax-un 7751
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-rmo 3366  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 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379
This theorem is used by:  zorn2lem2  10575  zorn2lem3  10576  zorn2lem4  10577  zorn2lem5  10578
  Copyright terms: Public domain W3C validator