ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfi Structured version   GIF version

Theorem tfi 4247
Description: The Principle of Transfinite Induction. Theorem 7.17 of [TakeutiZaring] p. 39. This principle states that if A is a class of ordinal numbers with the property that every ordinal number included in A also belongs to A, then every ordinal number is in A.

(Contributed by NM, 18-Feb-2004.)

Assertion
Ref Expression
tfi ((A ⊆ On x On (xAx A)) → A = On)
Distinct variable group:   x,A

Proof of Theorem tfi
Dummy variable y is distinct from all other variables.
StepHypRef Expression
1 df-ral 2305 . . . . . . 7 (x On (xAx A) ↔ x(x On → (xAx A)))
2 imdi 239 . . . . . . . 8 ((x On → (xAx A)) ↔ ((x On → xA) → (x On → x A)))
32albii 1356 . . . . . . 7 (x(x On → (xAx A)) ↔ x((x On → xA) → (x On → x A)))
41, 3bitri 173 . . . . . 6 (x On (xAx A) ↔ x((x On → xA) → (x On → x A)))
5 dfss2 2928 . . . . . . . . . 10 (xAy(y xy A))
65imbi2i 215 . . . . . . . . 9 ((x On → xA) ↔ (x On → y(y xy A)))
7 19.21v 1750 . . . . . . . . 9 (y(x On → (y xy A)) ↔ (x On → y(y xy A)))
86, 7bitr4i 176 . . . . . . . 8 ((x On → xA) ↔ y(x On → (y xy A)))
98imbi1i 227 . . . . . . 7 (((x On → xA) → (x On → x A)) ↔ (y(x On → (y xy A)) → (x On → x A)))
109albii 1356 . . . . . 6 (x((x On → xA) → (x On → x A)) ↔ x(y(x On → (y xy A)) → (x On → x A)))
114, 10bitri 173 . . . . 5 (x On (xAx A) ↔ x(y(x On → (y xy A)) → (x On → x A)))
12 simpl 102 . . . . . . . . . . 11 ((y x x On) → y x)
13 tron 4084 . . . . . . . . . . . . . 14 Tr On
14 dftr2 3846 . . . . . . . . . . . . . 14 (Tr On ↔ yx((y x x On) → y On))
1513, 14mpbi 133 . . . . . . . . . . . . 13 yx((y x x On) → y On)
1615spi 1426 . . . . . . . . . . . 12 x((y x x On) → y On)
1716spi 1426 . . . . . . . . . . 11 ((y x x On) → y On)
1812, 17jca 290 . . . . . . . . . 10 ((y x x On) → (y x y On))
1918imim1i 54 . . . . . . . . 9 (((y x y On) → y A) → ((y x x On) → y A))
20 impexp 250 . . . . . . . . 9 (((y x y On) → y A) ↔ (y x → (y On → y A)))
21 impexp 250 . . . . . . . . . 10 (((y x x On) → y A) ↔ (y x → (x On → y A)))
22 bi2.04 237 . . . . . . . . . 10 ((y x → (x On → y A)) ↔ (x On → (y xy A)))
2321, 22bitri 173 . . . . . . . . 9 (((y x x On) → y A) ↔ (x On → (y xy A)))
2419, 20, 233imtr3i 189 . . . . . . . 8 ((y x → (y On → y A)) → (x On → (y xy A)))
2524alimi 1341 . . . . . . 7 (y(y x → (y On → y A)) → y(x On → (y xy A)))
2625imim1i 54 . . . . . 6 ((y(x On → (y xy A)) → (x On → x A)) → (y(y x → (y On → y A)) → (x On → x A)))
2726alimi 1341 . . . . 5 (x(y(x On → (y xy A)) → (x On → x A)) → x(y(y x → (y On → y A)) → (x On → x A)))
2811, 27sylbi 114 . . . 4 (x On (xAx A) → x(y(y x → (y On → y A)) → (x On → x A)))
2928adantl 262 . . 3 ((A ⊆ On x On (xAx A)) → x(y(y x → (y On → y A)) → (x On → x A)))
30 sbim 1824 . . . . . . . . . 10 ([y / x](x On → x A) ↔ ([y / x]x On → [y / x]x A))
31 clelsb3 2139 . . . . . . . . . . 11 ([y / x]x On ↔ y On)
32 clelsb3 2139 . . . . . . . . . . 11 ([y / x]x Ay A)
3331, 32imbi12i 228 . . . . . . . . . 10 (([y / x]x On → [y / x]x A) ↔ (y On → y A))
3430, 33bitri 173 . . . . . . . . 9 ([y / x](x On → x A) ↔ (y On → y A))
3534ralbii 2324 . . . . . . . 8 (y x [y / x](x On → x A) ↔ y x (y On → y A))
36 df-ral 2305 . . . . . . . 8 (y x (y On → y A) ↔ y(y x → (y On → y A)))
3735, 36bitri 173 . . . . . . 7 (y x [y / x](x On → x A) ↔ y(y x → (y On → y A)))
3837imbi1i 227 . . . . . 6 ((y x [y / x](x On → x A) → (x On → x A)) ↔ (y(y x → (y On → y A)) → (x On → x A)))
3938albii 1356 . . . . 5 (x(y x [y / x](x On → x A) → (x On → x A)) ↔ x(y(y x → (y On → y A)) → (x On → x A)))
40 ax-setind 4219 . . . . 5 (x(y x [y / x](x On → x A) → (x On → x A)) → x(x On → x A))
4139, 40sylbir 125 . . . 4 (x(y(y x → (y On → y A)) → (x On → x A)) → x(x On → x A))
42 dfss2 2928 . . . 4 (On ⊆ Ax(x On → x A))
4341, 42sylibr 137 . . 3 (x(y(y x → (y On → y A)) → (x On → x A)) → On ⊆ A)
4429, 43syl 14 . 2 ((A ⊆ On x On (xAx A)) → On ⊆ A)
45 eqss 2954 . . 3 (A = On ↔ (A ⊆ On On ⊆ A))
4645biimpri 124 . 2 ((A ⊆ On On ⊆ A) → A = On)
4744, 46syldan 266 1 ((A ⊆ On x On (xAx A)) → A = On)
Colors of variables: wff set class
Syntax hints:  wi 4   wa 97  wal 1240   = wceq 1242   wcel 1390  [wsb 1642  wral 2300  wss 2911  Tr wtr 3844  Oncon0 4065
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019  ax-setind 4219
This theorem depends on definitions:  df-bi 110  df-3an 886  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ral 2305  df-rex 2306  df-v 2553  df-in 2918  df-ss 2925  df-uni 3571  df-tr 3845  df-iord 4068  df-on 4070
This theorem is referenced by:  tfis  4248
  Copyright terms: Public domain W3C validator