Theorem tfis2d 48111

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 3176	. . . 4 ⊢ (∀𝑦 ∈ 𝑥 (𝜑 → 𝜒) ↔ (𝜑 → ∀𝑦 ∈ 𝑥 𝜒))
5		tfis2d.2	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜒 → 𝜓)))
6	5	com12 32	. . . . 5 ⊢ (𝑥 ∈ On → (𝜑 → (∀𝑦 ∈ 𝑥 𝜒 → 𝜓)))
7	6	a2d 29	. . . 4 ⊢ (𝑥 ∈ On → ((𝜑 → ∀𝑦 ∈ 𝑥 𝜒) → (𝜑 → 𝜓)))
8	4, 7	biimtrid 241	. . 3 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 (𝜑 → 𝜒) → (𝜑 → 𝜓)))
9	3, 8	tfis2 7861	. 2 ⊢ (𝑥 ∈ On → (𝜑 → 𝜓))
10	9	com12 32	1 ⊢ (𝜑 → (𝑥 ∈ On → 𝜓))

Syntax hints:   → wi 4   ↔ wb 205   ∈ wcel 2099  ∀wral 3058  Oncon0 6369

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-ord 6372  df-on 6373

This theorem is referenced by: (None)