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

Theorem zorn2lem1 10587
Description: Lemma for zorn2 10597. (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 8420 . . . 4 (𝑥 ∈ On → (𝐹‘𝑥) = ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)))
32adantr 486 . . 3 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) = ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)))
41tfr1 8419 . . . . . 6 𝐹 Fn On
5 fnfun 6650 . . . . . 6 (𝐹 Fn On → Fun 𝐹)
64, 5ax-mp 5 . . . . 5 Fun 𝐹
7 vex 3458 . . . . 5 𝑥 ∈ V
8 resfunexg 7231 . . . . 5 ((Fun 𝐹 ∧ 𝑥 ∈ V) → (𝐹 ↾ 𝑥) ∈ V)
96, 7, 8mp2an 705 . . . 4 (𝐹 ↾ 𝑥) ∈ V
10 rneq 5923 . . . . . . . . . . . 12 (𝑓 = (𝐹 ↾ 𝑥) → ran 𝑓 = ran (𝐹 ↾ 𝑥))
11 df-ima 5668 . . . . . . . . . . . 12 (𝐹 “ 𝑥) = ran (𝐹 ↾ 𝑥)
1210, 11eqtr4di 2816 . . . . . . . . . . 11 (𝑓 = (𝐹 ↾ 𝑥) → ran 𝑓 = (𝐹 “ 𝑥))
1312eleq2d 2850 . . . . . . . . . 10 (𝑓 = (𝐹 ↾ 𝑥) → (𝑔 ∈ ran 𝑓 ↔ 𝑔 ∈ (𝐹 “ 𝑥)))
1413imbi1d 344 . . . . . . . . 9 (𝑓 = (𝐹 ↾ 𝑥) → ((𝑔 ∈ ran 𝑓 → 𝑔𝑅𝑧) ↔ (𝑔 ∈ (𝐹 “ 𝑥) → 𝑔𝑅𝑧)))
1514ralbidv2 3185 . . . . . . . 8 (𝑓 = (𝐹 ↾ 𝑥) → (∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧 ↔ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧))
1615rabbidv 3423 . . . . . . 7 (𝑓 = (𝐹 ↾ 𝑥) → {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧} = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧})
17 zorn2lem.4 . . . . . . 7 𝐶 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧}
18 zorn2lem.5 . . . . . . 7 𝐷 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧}
1916, 17, 183eqtr4g 2823 . . . . . 6 (𝑓 = (𝐹 ↾ 𝑥) → 𝐶 = 𝐷)
2019eleq2d 2850 . . . . . . . 8 (𝑓 = (𝐹 ↾ 𝑥) → (𝑢 ∈ 𝐶 ↔ 𝑢 ∈ 𝐷))
2120imbi1d 344 . . . . . . 7 (𝑓 = (𝐹 ↾ 𝑥) → ((𝑢 ∈ 𝐶 → ¬ 𝑢𝑤𝑣) ↔ (𝑢 ∈ 𝐷 → ¬ 𝑢𝑤𝑣)))
2221ralbidv2 3185 . . . . . 6 (𝑓 = (𝐹 ↾ 𝑥) → (∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣 ↔ ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
2319, 22riotaeqbidv 7390 . . . . 5 (𝑓 = (𝐹 ↾ 𝑥) → (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
24 eqid 2763 . . . . 5 (𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣)) = (𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))
25 riotaex 7391 . . . . 5 (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣) ∈ V
2623, 24, 25fvmpt 7004 . . . 4 ((𝐹 ↾ 𝑥) ∈ V → ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
279, 26ax-mp 5 . . 3 ((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))‘(𝐹 ↾ 𝑥)) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣)
283, 27eqtrdi 2814 . 2 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) = (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣))
29 simprl 783 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝑤 We 𝐴)
30 weso 5646 . . . . . . 7 (𝑤 We 𝐴 → 𝑤 Or 𝐴)
3130ad2antrl 741 . . . . . 6 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝑤 Or 𝐴)
32 vex 3458 . . . . . 6 𝑤 ∈ V
33 soex 7943 . . . . . 6 ((𝑤 Or 𝐴 ∧ 𝑤 ∈ V) → 𝐴 ∈ V)
3431, 32, 33sylancl 598 . . . . 5 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐴 ∈ V)
3518, 34rabexd 5305 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐷 ∈ V)
3618ssrab3 4010 . . . . 5 𝐷 ⊆ 𝐴
3736a1i 11 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐷 ⊆ 𝐴)
38 simprr 785 . . . 4 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → 𝐷 ≠ ∅)
39 wereu 5651 . . . 4 ((𝑤 We 𝐴 ∧ (𝐷 ∈ V ∧ 𝐷 ⊆ 𝐴 ∧ 𝐷 ≠ ∅)) → ∃!𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣)
4029, 35, 37, 38, 39syl13anc 1399 . . 3 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → ∃!𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣)
41 riotacl 7404 . . 3 (∃!𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣 → (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣) ∈ 𝐷)
4240, 41syl 18 . 2 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (℩𝑣 ∈ 𝐷 ∀𝑢 ∈ 𝐷 ¬ 𝑢𝑤𝑣) ∈ 𝐷)
4328, 42eqeltrd 2864 1 ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) ∈ 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ≠ wne 2959  ∀wral 3080  ∃!wreu 3367  {crab 3416  Vcvv 3454   ⊆ wss 3900  ∅c0 4281   class class class wbr 5106   ↦ cmpt 5189   Or wor 5562   We wwe 5607  ran crn 5656   ↾ cres 5657   “ cima 5658  Oncon0 6369  Fun wfun 6541   Fn wfn 6542  ‘cfv 6547  ℩crio 7386  recscrecs 8392
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393
This theorem is used by:  zorn2lem2  10588  zorn2lem3  10589  zorn2lem4  10590  zorn2lem5  10591
  Copyright terms: Public domain W3C validator