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

Theorem infpssrlem3 10422
Description: Lemma for infpssr 10425. (Contributed by Stefan O'Rear, 30-Oct-2014.)
Hypotheses
Ref Expression
infpssrlem.a (𝜑 → 𝐵 ⊆ 𝐴)
infpssrlem.c (𝜑 → 𝐹:𝐵⟶1-1onto𝐴)
infpssrlem.d (𝜑 → 𝐶 ∈ (𝐴 ∖ 𝐵))
infpssrlem.e 𝐺 = (rec(◡𝐹, 𝐶) ↾ ω)
Assertion
Ref Expression
infpssrlem3 (𝜑 → 𝐺:ω⟶𝐴)

Proof of Theorem infpssrlem3
Dummy variables 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frfnom 8481 . . . 4 (rec(◡𝐹, 𝐶) ↾ ω) Fn ω
2 infpssrlem.e . . . . 5 𝐺 = (rec(◡𝐹, 𝐶) ↾ ω)
32fneq1i 6666 . . . 4 (𝐺 Fn ω ↔ (rec(◡𝐹, 𝐶) ↾ ω) Fn ω)
41, 3mpbir 234 . . 3 𝐺 Fn ω
54a1i 11 . 2 (𝜑 → 𝐺 Fn ω)
6 fveq2 6916 . . . . . 6 (𝑐 = ∅ → (𝐺‘𝑐) = (𝐺‘∅))
76eleq1d 2849 . . . . 5 (𝑐 = ∅ → ((𝐺‘𝑐) ∈ 𝐴 ↔ (𝐺‘∅) ∈ 𝐴))
8 fveq2 6916 . . . . . 6 (𝑐 = 𝑏 → (𝐺‘𝑐) = (𝐺‘𝑏))
98eleq1d 2849 . . . . 5 (𝑐 = 𝑏 → ((𝐺‘𝑐) ∈ 𝐴 ↔ (𝐺‘𝑏) ∈ 𝐴))
10 fveq2 6916 . . . . . 6 (𝑐 = suc 𝑏 → (𝐺‘𝑐) = (𝐺‘suc 𝑏))
1110eleq1d 2849 . . . . 5 (𝑐 = suc 𝑏 → ((𝐺‘𝑐) ∈ 𝐴 ↔ (𝐺‘suc 𝑏) ∈ 𝐴))
12 infpssrlem.a . . . . . . 7 (𝜑 → 𝐵 ⊆ 𝐴)
13 infpssrlem.c . . . . . . 7 (𝜑 → 𝐹:𝐵⟶1-1onto𝐴)
14 infpssrlem.d . . . . . . 7 (𝜑 → 𝐶 ∈ (𝐴 ∖ 𝐵))
1512, 13, 14, 2infpssrlem1 10420 . . . . . 6 (𝜑 → (𝐺‘∅) = 𝐶)
1614eldifad 4054 . . . . . 6 (𝜑 → 𝐶 ∈ 𝐴)
1715, 16eqeltrd 2864 . . . . 5 (𝜑 → (𝐺‘∅) ∈ 𝐴)
1812adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝐺‘𝑏) ∈ 𝐴) → 𝐵 ⊆ 𝐴)
19 f1ocnv 6867 . . . . . . . . . 10 (𝐹:𝐵⟶1-1onto𝐴 → ◡𝐹:𝐴⟶1-1onto𝐵)
20 f1of 6854 . . . . . . . . . 10 (◡𝐹:𝐴⟶1-1onto𝐵 → ◡𝐹:𝐴⟶𝐵)
2113, 19, 203syl 19 . . . . . . . . 9 (𝜑 → ◡𝐹:𝐴⟶𝐵)
2221ffvelcdmda 7116 . . . . . . . 8 ((𝜑 ∧ (𝐺‘𝑏) ∈ 𝐴) → (◡𝐹‘(𝐺‘𝑏)) ∈ 𝐵)
2318, 22sseldd 3914 . . . . . . 7 ((𝜑 ∧ (𝐺‘𝑏) ∈ 𝐴) → (◡𝐹‘(𝐺‘𝑏)) ∈ 𝐴)
2412, 13, 14, 2infpssrlem2 10421 . . . . . . . 8 (𝑏 ∈ ω → (𝐺‘suc 𝑏) = (◡𝐹‘(𝐺‘𝑏)))
2524eleq1d 2849 . . . . . . 7 (𝑏 ∈ ω → ((𝐺‘suc 𝑏) ∈ 𝐴 ↔ (◡𝐹‘(𝐺‘𝑏)) ∈ 𝐴))
2623, 25imbitrrid 249 . . . . . 6 (𝑏 ∈ ω → ((𝜑 ∧ (𝐺‘𝑏) ∈ 𝐴) → (𝐺‘suc 𝑏) ∈ 𝐴))
2726expd 421 . . . . 5 (𝑏 ∈ ω → (𝜑 → ((𝐺‘𝑏) ∈ 𝐴 → (𝐺‘suc 𝑏) ∈ 𝐴)))
287, 9, 11, 17, 27finds2 7944 . . . 4 (𝑐 ∈ ω → (𝜑 → (𝐺‘𝑐) ∈ 𝐴))
2928com12 33 . . 3 (𝜑 → (𝑐 ∈ ω → (𝐺‘𝑐) ∈ 𝐴))
3029ralrimiv 3157 . 2 (𝜑 → ∀𝑐 ∈ ω (𝐺‘𝑐) ∈ 𝐴)
31 ffnfv 7151 . 2 (𝐺:ω⟶𝐴 ↔ (𝐺 Fn ω ∧ ∀𝑐 ∈ ω (𝐺‘𝑐) ∈ 𝐴))
325, 30, 31sylanbrc 595 1 (𝜑 → 𝐺:ω⟶𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  ◡ccnv 5657   ↾ cres 5660  suc csuc 6390   Fn wfn 6561  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘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:  infpssrlem4  10423  infpssrlem5  10424
  Copyright terms: Public domain W3C validator