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

Theorem tfrlem5 8436
Description: Lemma for transfinite recursion. The values of two acceptable functions are the same within their domains. (Contributed by NM, 9-Apr-1995.) (Revised by Mario Carneiro, 24-May-2019.)
Hypothesis
Ref Expression
tfrlem.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
Assertion
Ref Expression
tfrlem5 ((𝑔𝐴𝐴) → ((𝑥𝑔𝑢𝑥𝑣) → 𝑢 = 𝑣))
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,,𝑢,𝑣,𝐹   𝐴,𝑔,
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑣,𝑢,𝑓)

Proof of Theorem tfrlem5
Dummy variables 𝑧 𝑎 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrlem.1 . . 3 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
2 vex 3492 . . 3 𝑔 ∈ V
31, 2tfrlem3a 8433 . 2 (𝑔𝐴 ↔ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))))
4 vex 3492 . . 3 ∈ V
51, 4tfrlem3a 8433 . 2 (𝐴 ↔ ∃𝑤 ∈ On ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎))))
6 reeanv 3235 . . 3 (∃𝑧 ∈ On ∃𝑤 ∈ On ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ↔ (∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ∃𝑤 ∈ On ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))))
7 fveq2 6920 . . . . . . . 8 (𝑎 = 𝑥 → (𝑔𝑎) = (𝑔𝑥))
8 fveq2 6920 . . . . . . . 8 (𝑎 = 𝑥 → (𝑎) = (𝑥))
97, 8eqeq12d 2756 . . . . . . 7 (𝑎 = 𝑥 → ((𝑔𝑎) = (𝑎) ↔ (𝑔𝑥) = (𝑥)))
10 onin 6426 . . . . . . . . 9 ((𝑧 ∈ On ∧ 𝑤 ∈ On) → (𝑧𝑤) ∈ On)
11103ad2ant1 1133 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (𝑧𝑤) ∈ On)
12 simp2ll 1240 . . . . . . . . . 10 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑔 Fn 𝑧)
13 fnfun 6679 . . . . . . . . . 10 (𝑔 Fn 𝑧 → Fun 𝑔)
1412, 13syl 17 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → Fun 𝑔)
15 inss1 4258 . . . . . . . . . 10 (𝑧𝑤) ⊆ 𝑧
1612fndmd 6684 . . . . . . . . . 10 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → dom 𝑔 = 𝑧)
1715, 16sseqtrrid 4062 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (𝑧𝑤) ⊆ dom 𝑔)
1814, 17jca 511 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (Fun 𝑔 ∧ (𝑧𝑤) ⊆ dom 𝑔))
19 simp2rl 1242 . . . . . . . . . 10 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → Fn 𝑤)
20 fnfun 6679 . . . . . . . . . 10 ( Fn 𝑤 → Fun )
2119, 20syl 17 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → Fun )
22 inss2 4259 . . . . . . . . . 10 (𝑧𝑤) ⊆ 𝑤
2319fndmd 6684 . . . . . . . . . 10 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → dom = 𝑤)
2422, 23sseqtrrid 4062 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (𝑧𝑤) ⊆ dom )
2521, 24jca 511 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (Fun ∧ (𝑧𝑤) ⊆ dom ))
26 simp2lr 1241 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎)))
27 ssralv 4077 . . . . . . . . 9 ((𝑧𝑤) ⊆ 𝑧 → (∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎)) → ∀𝑎 ∈ (𝑧𝑤)(𝑔𝑎) = (𝐹‘(𝑔𝑎))))
2815, 26, 27mpsyl 68 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → ∀𝑎 ∈ (𝑧𝑤)(𝑔𝑎) = (𝐹‘(𝑔𝑎)))
29 simp2rr 1243 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))
30 ssralv 4077 . . . . . . . . 9 ((𝑧𝑤) ⊆ 𝑤 → (∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)) → ∀𝑎 ∈ (𝑧𝑤)(𝑎) = (𝐹‘(𝑎))))
3122, 29, 30mpsyl 68 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → ∀𝑎 ∈ (𝑧𝑤)(𝑎) = (𝐹‘(𝑎)))
3211, 18, 25, 28, 31tfrlem1 8432 . . . . . . 7 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → ∀𝑎 ∈ (𝑧𝑤)(𝑔𝑎) = (𝑎))
33 simp3l 1201 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑥𝑔𝑢)
34 fnbr 6687 . . . . . . . . 9 ((𝑔 Fn 𝑧𝑥𝑔𝑢) → 𝑥𝑧)
3512, 33, 34syl2anc 583 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑥𝑧)
36 simp3r 1202 . . . . . . . . 9 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑥𝑣)
37 fnbr 6687 . . . . . . . . 9 (( Fn 𝑤𝑥𝑣) → 𝑥𝑤)
3819, 36, 37syl2anc 583 . . . . . . . 8 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑥𝑤)
3935, 38elind 4223 . . . . . . 7 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑥 ∈ (𝑧𝑤))
409, 32, 39rspcdva 3636 . . . . . 6 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (𝑔𝑥) = (𝑥))
41 funbrfv 6971 . . . . . . 7 (Fun 𝑔 → (𝑥𝑔𝑢 → (𝑔𝑥) = 𝑢))
4214, 33, 41sylc 65 . . . . . 6 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (𝑔𝑥) = 𝑢)
43 funbrfv 6971 . . . . . . 7 (Fun → (𝑥𝑣 → (𝑥) = 𝑣))
4421, 36, 43sylc 65 . . . . . 6 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → (𝑥) = 𝑣)
4540, 42, 443eqtr3d 2788 . . . . 5 (((𝑧 ∈ On ∧ 𝑤 ∈ On) ∧ ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) ∧ (𝑥𝑔𝑢𝑥𝑣)) → 𝑢 = 𝑣)
46453exp 1119 . . . 4 ((𝑧 ∈ On ∧ 𝑤 ∈ On) → (((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) → ((𝑥𝑔𝑢𝑥𝑣) → 𝑢 = 𝑣)))
4746rexlimivv 3207 . . 3 (∃𝑧 ∈ On ∃𝑤 ∈ On ((𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) → ((𝑥𝑔𝑢𝑥𝑣) → 𝑢 = 𝑣))
486, 47sylbir 235 . 2 ((∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑎𝑧 (𝑔𝑎) = (𝐹‘(𝑔𝑎))) ∧ ∃𝑤 ∈ On ( Fn 𝑤 ∧ ∀𝑎𝑤 (𝑎) = (𝐹‘(𝑎)))) → ((𝑥𝑔𝑢𝑥𝑣) → 𝑢 = 𝑣))
493, 5, 48syl2anb 597 1 ((𝑔𝐴𝐴) → ((𝑥𝑔𝑢𝑥𝑣) → 𝑢 = 𝑣))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1537  wcel 2108  {cab 2717  wral 3067  wrex 3076  cin 3975  wss 3976   class class class wbr 5166  dom cdm 5700  cres 5702  Oncon0 6395  Fun wfun 6567   Fn wfn 6568  cfv 6573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-iota 6525  df-fun 6575  df-fn 6576  df-fv 6581
This theorem is referenced by:  tfrlem7  8439
  Copyright terms: Public domain W3C validator