Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1018g Structured version   Visualization version   GIF version

Theorem bnj1018g 35260
Description: Version of bnj1018 35261 with less disjoint variable conditions, but requiring ax-13 2405. (Contributed by GG, 27-Mar-2024.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1018.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1018.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1018.3 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
bnj1018.4 (𝜃 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
bnj1018.5 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛))
bnj1018.7 (𝜑′[𝑝 / 𝑛]𝜑)
bnj1018.8 (𝜓′[𝑝 / 𝑛]𝜓)
bnj1018.9 (𝜒′[𝑝 / 𝑛]𝜒)
bnj1018.10 (𝜑″[𝐺 / 𝑓]𝜑′)
bnj1018.11 (𝜓″[𝐺 / 𝑓]𝜓′)
bnj1018.12 (𝜒″[𝐺 / 𝑓]𝜒′)
bnj1018.13 𝐷 = (ω ∖ {∅})
bnj1018.14 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
bnj1018.15 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
bnj1018.16 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
bnj1018.26 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
bnj1018.29 ((𝜃𝜒𝜏𝜂) → 𝜒″)
bnj1018.30 ((𝜃𝜒𝜏𝜂) → (𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝))
Assertion
Ref Expression
bnj1018g ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
Distinct variable groups:   𝐴,𝑓,𝑖,𝑚,𝑛,𝑦   𝐷,𝑓,𝑖,𝑛   𝑖,𝐺,𝑝   𝑅,𝑓,𝑖,𝑚,𝑛,𝑦   𝑓,𝑋,𝑖,𝑛,𝑦   𝜒,𝑝   𝜂,𝑝   𝑓,𝑝   𝜑,𝑖   𝜃,𝑝
Allowed substitution hints:   𝜑(𝑦,𝑧,𝑓,𝑚,𝑛,𝑝)   𝜓(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛)   𝜃(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛)   𝜏(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜂(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛)   𝐴(𝑧,𝑝)   𝐵(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐶(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑦,𝑧,𝑚,𝑝)   𝑅(𝑧,𝑝)   𝐺(𝑦,𝑧,𝑓,𝑚,𝑛)   𝑋(𝑧,𝑚,𝑝)   𝜑′(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓′(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒′(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑″(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓″(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒″(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj1018g
StepHypRef Expression
1 df-bnj17 34985 . . 3 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) ↔ ((𝜃𝜒𝜂) ∧ ∃𝑝𝜏))
2 bnj258 35006 . . . . . . . 8 ((𝜃𝜒𝜏𝜂) ↔ ((𝜃𝜒𝜂) ∧ 𝜏))
3 bnj1018.29 . . . . . . . 8 ((𝜃𝜒𝜏𝜂) → 𝜒″)
42, 3sylbir 237 . . . . . . 7 (((𝜃𝜒𝜂) ∧ 𝜏) → 𝜒″)
54ex 416 . . . . . 6 ((𝜃𝜒𝜂) → (𝜏𝜒″))
65eximdv 1939 . . . . 5 ((𝜃𝜒𝜂) → (∃𝑝𝜏 → ∃𝑝𝜒″))
7 bnj1018.3 . . . . . 6 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
8 bnj1018.9 . . . . . 6 (𝜒′[𝑝 / 𝑛]𝜒)
9 bnj1018.12 . . . . . 6 (𝜒″[𝐺 / 𝑓]𝜒′)
10 bnj1018.14 . . . . . 6 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
11 bnj1018.16 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
127, 8, 9, 10, 11bnj985 35251 . . . . 5 (𝐺𝐵 ↔ ∃𝑝𝜒″)
136, 12imbitrrdi 254 . . . 4 ((𝜃𝜒𝜂) → (∃𝑝𝜏𝐺𝐵))
1413imp 410 . . 3 (((𝜃𝜒𝜂) ∧ ∃𝑝𝜏) → 𝐺𝐵)
151, 14sylbi 219 . 2 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → 𝐺𝐵)
16 bnj1019 35077 . . 3 (∃𝑝(𝜃𝜒𝜏𝜂) ↔ (𝜃𝜒𝜂 ∧ ∃𝑝𝜏))
17 bnj1018.30 . . . . . 6 ((𝜃𝜒𝜏𝜂) → (𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝))
1817simp3d 1158 . . . . 5 ((𝜃𝜒𝜏𝜂) → suc 𝑖𝑝)
19 bnj1018.26 . . . . . . 7 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
2019bnj1235 35101 . . . . . 6 (𝜒″𝐺 Fn 𝑝)
21 fndm 6626 . . . . . 6 (𝐺 Fn 𝑝 → dom 𝐺 = 𝑝)
223, 20, 213syl 18 . . . . 5 ((𝜃𝜒𝜏𝜂) → dom 𝐺 = 𝑝)
2318, 22eleqtrrd 2867 . . . 4 ((𝜃𝜒𝜏𝜂) → suc 𝑖 ∈ dom 𝐺)
2423exlimiv 1952 . . 3 (∃𝑝(𝜃𝜒𝜏𝜂) → suc 𝑖 ∈ dom 𝐺)
2516, 24sylbir 237 . 2 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → suc 𝑖 ∈ dom 𝐺)
26 bnj1018.1 . . 3 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
27 bnj1018.2 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
28 bnj1018.13 . . 3 𝐷 = (ω ∖ {∅})
2911bnj918 35064 . . 3 𝐺 ∈ V
30 vex 3460 . . . 4 𝑖 ∈ V
3130sucex 7791 . . 3 suc 𝑖 ∈ V
3226, 27, 28, 10, 29, 31bnj1015 35259 . 2 ((𝐺𝐵 ∧ suc 𝑖 ∈ dom 𝐺) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
3315, 25, 32syl2anc 593 1 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1099   = wceq 1562  wex 1801  wcel 2144  {cab 2742  wral 3078  wrex 3088  Vcvv 3456  [wsbc 3746  cdif 3903  cun 3904  wss 3906  c0 4287  {csn 4584  cop 4590   ciun 4951  dom cdm 5649  suc csuc 6350   Fn wfn 6518  cfv 6523  ωcom 7848  w-bnj17 34984   predc-bnj14 34986   FrSe w-bnj15 34990   trClc-bnj18 34992
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-13 2405  ax-ext 2736  ax-sep 5248  ax-pr 5392  ax-un 7720
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-dm 5659  df-suc 6354  df-iota 6479  df-fn 6526  df-fv 6531  df-bnj17 34985  df-bnj18 34993
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator