Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  aomclem3 Structured version   Visualization version   GIF version

Theorem aomclem3 44324
Description: Lemma for dfac11 44330. Successor case 3, our required well-ordering. (Contributed by Stefan O'Rear, 19-Jan-2015.)
Hypotheses
Ref Expression
aomclem3.b 𝐵 = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))}
aomclem3.c 𝐶 = (𝑎 ∈ V ↦ sup((𝑦‘𝑎), (𝑅1‘dom 𝑧), 𝐵))
aomclem3.d 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))))
aomclem3.e 𝐸 = {⟨𝑎, 𝑏⟩ ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})}
aomclem3.on (𝜑 → dom 𝑧 ∈ On)
aomclem3.su (𝜑 → dom 𝑧 = suc ∪ dom 𝑧)
aomclem3.we (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
aomclem3.a (𝜑 → 𝐴 ∈ On)
aomclem3.za (𝜑 → dom 𝑧 ⊆ 𝐴)
aomclem3.y (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
Assertion
Ref Expression
aomclem3 (𝜑 → 𝐸 We (𝑅1‘dom 𝑧))
Distinct variable groups:   𝑦,𝑧,𝑎,𝑏,𝑐,𝑑   𝜑,𝑎,𝑏   𝐶,𝑎,𝑏,𝑐,𝑑   𝐷,𝑎,𝑏,𝑐,𝑑
Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑐, 𝑑)   𝐴(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝐵(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝐶(𝑦, 𝑧)   𝐷(𝑦, 𝑧)   𝐸(𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)

Proof of Theorem aomclem3
StepHypRef Expression
1 aomclem3.d . . 3 𝐷 = recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))))
2 rneq 5930 . . . . . . 7 (𝑎 = 𝑐 → ran 𝑎 = ran 𝑐)
32difeq2d 4066 . . . . . 6 (𝑎 = 𝑐 → ((𝑅1‘dom 𝑧) ∖ ran 𝑎) = ((𝑅1‘dom 𝑧) ∖ ran 𝑐))
43fveq2d 6920 . . . . 5 (𝑎 = 𝑐 → (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)) = (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐)))
54cbvmptv 5215 . . . 4 (𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))) = (𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐)))
6 recseq 8419 . . . 4 ((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎))) = (𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))) → recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) = recs((𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐)))))
75, 6ax-mp 5 . . 3 recs((𝑎 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑎)))) = recs((𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))))
81, 7eqtri 2786 . 2 𝐷 = recs((𝑐 ∈ V ↦ (𝐶‘((𝑅1‘dom 𝑧) ∖ ran 𝑐))))
9 fvexd 6931 . 2 (𝜑 → (𝑅1‘dom 𝑧) ∈ V)
10 aomclem3.b . . . 4 𝐵 = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐 ∈ (𝑅1‘∪ dom 𝑧)((𝑐 ∈ 𝑏 ∧ ¬ 𝑐 ∈ 𝑎) ∧ ∀𝑑 ∈ (𝑅1‘∪ dom 𝑧)(𝑑(𝑧‘∪ dom 𝑧)𝑐 → (𝑑 ∈ 𝑎 ↔ 𝑑 ∈ 𝑏)))}
11 aomclem3.c . . . 4 𝐶 = (𝑎 ∈ V ↦ sup((𝑦‘𝑎), (𝑅1‘dom 𝑧), 𝐵))
12 aomclem3.on . . . 4 (𝜑 → dom 𝑧 ∈ On)
13 aomclem3.su . . . 4 (𝜑 → dom 𝑧 = suc ∪ dom 𝑧)
14 aomclem3.we . . . 4 (𝜑 → ∀𝑎 ∈ dom 𝑧(𝑧‘𝑎) We (𝑅1‘𝑎))
15 aomclem3.a . . . 4 (𝜑 → 𝐴 ∈ On)
16 aomclem3.za . . . 4 (𝜑 → dom 𝑧 ⊆ 𝐴)
17 aomclem3.y . . . 4 (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘𝐴)(𝑎 ≠ ∅ → (𝑦‘𝑎) ∈ ((𝒫 𝑎 ∩ Fin) ∖ {∅})))
1810, 11, 12, 13, 14, 15, 16, 17aomclem2 44323 . . 3 (𝜑 → ∀𝑎 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑎 ≠ ∅ → (𝐶‘𝑎) ∈ 𝑎))
19 neeq1 3021 . . . . 5 (𝑎 = 𝑑 → (𝑎 ≠ ∅ ↔ 𝑑 ≠ ∅))
20 fveq2 6916 . . . . . 6 (𝑎 = 𝑑 → (𝐶‘𝑎) = (𝐶‘𝑑))
21 id 23 . . . . . 6 (𝑎 = 𝑑 → 𝑎 = 𝑑)
2220, 21eleq12d 2858 . . . . 5 (𝑎 = 𝑑 → ((𝐶‘𝑎) ∈ 𝑎 ↔ (𝐶‘𝑑) ∈ 𝑑))
2319, 22imbi12d 347 . . . 4 (𝑎 = 𝑑 → ((𝑎 ≠ ∅ → (𝐶‘𝑎) ∈ 𝑎) ↔ (𝑑 ≠ ∅ → (𝐶‘𝑑) ∈ 𝑑)))
2423cbvralvw 3244 . . 3 (∀𝑎 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑎 ≠ ∅ → (𝐶‘𝑎) ∈ 𝑎) ↔ ∀𝑑 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑑 ≠ ∅ → (𝐶‘𝑑) ∈ 𝑑))
2518, 24sylib 221 . 2 (𝜑 → ∀𝑑 ∈ 𝒫 (𝑅1‘dom 𝑧)(𝑑 ≠ ∅ → (𝐶‘𝑑) ∈ 𝑑))
26 aomclem3.e . 2 𝐸 = {⟨𝑎, 𝑏⟩ ∣ ∩ (◡𝐷 “ {𝑎}) ∈ ∩ (◡𝐷 “ {𝑏})}
278, 9, 25, 26dnwech 44321 1 (𝜑 → 𝐸 We (𝑅1‘dom 𝑧))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872  ∩ cint 4912   class class class wbr 5108  {copab 5173   ↦ cmpt 5192   We wwe 5610  ◡ccnv 5657  dom cdm 5658  ran crn 5659   “ cima 5661  Oncon0 6388  suc csuc 6390  ‘cfv 6566  recscrecs 8416  Fincfn 9011  supcsup 9469  𝑅1cr1 9803
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  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 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-map 8887  df-en 9012  df-fin 9015  df-sup 9471  df-r1 9805
This theorem is used by:  aomclem5  44326
  Copyright terms: Public domain W3C validator