Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-rdg0gALT Structured version   Visualization version   GIF version

Theorem bj-rdg0gALT 38256
Description: Alternate proof of rdg0g 8473. More direct since it bypasses tz7.44-1 8452 and rdg0 8467 (and vtoclg 3521, vtoclga 3540). (Contributed by NM, 25-Apr-1995.) More direct proof. (Revised by BJ, 17-Nov-2024.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
bj-rdg0gALT (𝐴 ∈ 𝑉 → (rec(𝐹, 𝐴)‘∅) = 𝐴)

Proof of Theorem bj-rdg0gALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 rdgdmlim 8463 . . . . 5 Lim dom rec(𝐹, 𝐴)
2 limomss 7916 . . . . 5 (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴))
31, 2ax-mp 5 . . . 4 ω ⊆ dom rec(𝐹, 𝐴)
4 peano1 7934 . . . 4 ∅ ∈ ω
53, 4sselii 3910 . . 3 ∅ ∈ dom rec(𝐹, 𝐴)
6 rdgvalg 8465 . . 3 (∅ ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘∅) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ ∅)))
75, 6ax-mp 5 . 2 (rec(𝐹, 𝐴)‘∅) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ ∅))
8 res0 5990 . . . 4 (rec(𝐹, 𝐴) ↾ ∅) = ∅
98fveq2i 6919 . . 3 ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ ∅)) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘∅)
10 eqid 2763 . . . 4 (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))
11 simpr 490 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝑥 = ∅) → 𝑥 = ∅)
1211iftrued 4493 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝑥 = ∅) → if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))) = 𝐴)
13 0ex 5267 . . . . 5 ∅ ∈ V
1413a1i 11 . . . 4 (𝐴 ∈ 𝑉 → ∅ ∈ V)
15 id 23 . . . 4 (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉)
1610, 12, 14, 15fvmptd2 7033 . . 3 (𝐴 ∈ 𝑉 → ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘∅) = 𝐴)
179, 16eqtrid 2810 . 2 (𝐴 ∈ 𝑉 → ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ ∅)) = 𝐴)
187, 17eqtrid 2810 1 (𝐴 ∈ 𝑉 → (rec(𝐹, 𝐴)‘∅) = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ifcif 4485  ∪ cuni 4872   ↦ cmpt 5192  dom cdm 5658  ran crn 5659   ↾ cres 5660  Lim wlim 6389  ‘cfv 6566  ωcom 7911  reccrdg 8455
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-sep 5255  ax-nul 5266  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-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-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-ov 7454  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator