Theorem tfis2d 49711

Description: Transfinite Induction Schema, using implicit substitution. (Contributed by Emmett Weisz, 3-May-2020.)

Hypotheses

Ref	Expression
tfis2d.1	⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
tfis2d.2	⊢ (𝜑 → (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜒 → 𝜓)))

Assertion

Ref	Expression
tfis2d	⊢ (𝜑 → (𝑥 ∈ On → 𝜓))

Distinct variable groups:   𝜑,𝑥,𝑦   𝜒,𝑥   𝜓,𝑦

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)

Proof of Theorem tfis2d

Step	Hyp	Ref	Expression
1		tfis2d.1	. . . . 5 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 ↔ 𝜒)))
2	1	com12 32	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 → (𝜓 ↔ 𝜒)))
3	2	pm5.74d 273	. . 3 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜒)))
4		r19.21v 3157	. . . 4 ⊢ (∀𝑦 ∈ 𝑥 (𝜑 → 𝜒) ↔ (𝜑 → ∀𝑦 ∈ 𝑥 𝜒))
5		tfis2d.2	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜒 → 𝜓)))
6	5	com12 32	. . . . 5 ⊢ (𝑥 ∈ On → (𝜑 → (∀𝑦 ∈ 𝑥 𝜒 → 𝜓)))
7	6	a2d 29	. . . 4 ⊢ (𝑥 ∈ On → ((𝜑 → ∀𝑦 ∈ 𝑥 𝜒) → (𝜑 → 𝜓)))
8	4, 7	biimtrid 242	. . 3 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 (𝜑 → 𝜒) → (𝜑 → 𝜓)))
9	3, 8	tfis2 7787	. 2 ⊢ (𝑥 ∈ On → (𝜑 → 𝜓))
10	9	com12 32	1 ⊢ (𝜑 → (𝑥 ∈ On → 𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∈ wcel 2111  ∀wral 3047  Oncon0 6306

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5092  df-opab 5154  df-tr 5199  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-ord 6309  df-on 6310

This theorem is referenced by: (None)