Theorem bnj156 34446

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj156.1	⊢ (𝜁0 ↔ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
bnj156.2	⊢ (𝜁1 ↔ [𝑔 / 𝑓]𝜁0)
bnj156.3	⊢ (𝜑1 ↔ [𝑔 / 𝑓]𝜑′)
bnj156.4	⊢ (𝜓1 ↔ [𝑔 / 𝑓]𝜓′)

Assertion

Ref	Expression
bnj156	⊢ (𝜁1 ↔ (𝑔 Fn 1o ∧ 𝜑1 ∧ 𝜓1))

Proof of Theorem bnj156

Step	Hyp	Ref	Expression
1		bnj156.2	. 2 ⊢ (𝜁1 ↔ [𝑔 / 𝑓]𝜁0)
2		bnj156.1	. . . 4 ⊢ (𝜁0 ↔ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
3	2	sbcbii 3835	. . 3 ⊢ ([𝑔 / 𝑓]𝜁0 ↔ [𝑔 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
4		sbc3an 3844	. . . 4 ⊢ ([𝑔 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ ([𝑔 / 𝑓]𝑓 Fn 1o ∧ [𝑔 / 𝑓]𝜑′ ∧ [𝑔 / 𝑓]𝜓′))
5		bnj62 34438	. . . . 5 ⊢ ([𝑔 / 𝑓]𝑓 Fn 1o ↔ 𝑔 Fn 1o)
6		bnj156.3	. . . . . 6 ⊢ (𝜑1 ↔ [𝑔 / 𝑓]𝜑′)
7	6	bicomi 223	. . . . 5 ⊢ ([𝑔 / 𝑓]𝜑′ ↔ 𝜑1)
8		bnj156.4	. . . . . 6 ⊢ (𝜓1 ↔ [𝑔 / 𝑓]𝜓′)
9	8	bicomi 223	. . . . 5 ⊢ ([𝑔 / 𝑓]𝜓′ ↔ 𝜓1)
10	5, 7, 9	3anbi123i 1152	. . . 4 ⊢ (([𝑔 / 𝑓]𝑓 Fn 1o ∧ [𝑔 / 𝑓]𝜑′ ∧ [𝑔 / 𝑓]𝜓′) ↔ (𝑔 Fn 1o ∧ 𝜑1 ∧ 𝜓1))
11	4, 10	bitri 274	. . 3 ⊢ ([𝑔 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ (𝑔 Fn 1o ∧ 𝜑1 ∧ 𝜓1))
12	3, 11	bitri 274	. 2 ⊢ ([𝑔 / 𝑓]𝜁0 ↔ (𝑔 Fn 1o ∧ 𝜑1 ∧ 𝜓1))
13	1, 12	bitri 274	1 ⊢ (𝜁1 ↔ (𝑔 Fn 1o ∧ 𝜑1 ∧ 𝜓1))

Syntax hints:   ↔ wb 205   ∧ w3a 1084  [wsbc 3774   Fn wfn 6542  1_oc1o 8478

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-rab 3420  df-v 3465  df-sbc 3775  df-dif 3948  df-un 3950  df-ss 3962  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5149  df-opab 5211  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-fun 6549  df-fn 6550

This theorem is referenced by:  bnj153  34598

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »